MétaCan
Menu
Back to cohort
Record W2105148789 · doi:10.1145/545056.545107

Being the new guy in an experienced team

2002· article· en· W2105148789 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsFlexibility (engineering)Computer scienceProcess (computing)Action (physics)Focus (optics)Artificial intelligenceScratchHuman–computer interactionKnowledge managementManagement

Abstract

fetched live from OpenAlex

We present a modification to evolutionary on-line learning of cooperative behavior, based on a special action "learn", that allows the performance of a new agent replacing an old agent with somewhat different abilities in an experienced team to be improved. The general idea is to make us of the strategy of the old agent, obtained either directly or by the model the other team members made of it. This would be used as a seed strategy in the on-line learning process providing a focus to the process. This way, the flexibility of on-line learning remains, and the new agent is much less prone to making "beginner" mistakes that may prevent achievement of the team goal. Experiments with rather different variants of the pursuit game show that our method allows new agents to overcome the difference in abilities rather quickly. Thus, team performance is much better than when the new agent starts learning from scratch.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.942
Threshold uncertainty score0.245

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.028
GPT teacher head0.260
Teacher spread0.232 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations12
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicReinforcement Learning in RoboticsFrench-language works237,207