MétaCan
Menu
Back to cohort
Record W4360771686 · doi:10.1109/icmla55696.2022.00008

Keynotes

2022· article· en· W4360771686 on OpenAlexaff
Geoff Gordon, Plamen Angelov

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsMicrosoft (Canada)
Fundersnot available
KeywordsComputer science

Abstract

fetched live from OpenAlex

We often need to teach an agent to follow a desired behavior in a given environment -for example when creating an intelligent software assistant, a mobile robot, or a character in a video game. This sort of behavior design problem is harder than supervised learning, for several reasons. First, sequential decisions are harder than decisions made one at a time: we have to deal with compounding errors, distribution shift, exploration, and the influence of function approximation. Second, it can be hard for designers to communicate their intentions, so we may need to refine our behavior iteratively. This sort of iterative refinement means that we need our learner to be legible (the designer can predict how it will act), interpretable (the designer can understand why it acts a given way), and responsive (able to change behavior based on feedback). Finally, we have to handle many different kinds of feedback, such as demonstrations, constraints, comparisons, rewards, and nudges. Despite the difficulties, there are many kinds of tools that can help us with behavior design, including reinforcement learning, imitation learning, model learning, and representation learning. We'll cover several of these tools, and present them through examples.

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.

How this classification was reachedexpand

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: Methods · Consensus signal: none
Teacher disagreement score0.916
Threshold uncertainty score0.689

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.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.010
GPT teacher head0.208
Teacher spread0.198 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicReinforcement Learning in RoboticsFrench-language works237,207