MétaCan
Menu
Back to cohort
Record W2766724300 · doi:10.1016/j.ifacol.2017.08.1326

On Synchronous Binary Log-Linear Learning and Second Order Q-learning

2017· article· en· W2766724300 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

VenueIFAC-PapersOnLine · 2017
Typearticle
Languageen
FieldDecision Sciences
TopicGame Theory and Applications
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsBinary numberComputer scienceFocus (optics)Artificial intelligenceAlgorithmLog-linear modelQ-learningBinary search algorithmBinary classificationOrder (exchange)MathematicsMachine learningLinear modelSearch algorithmReinforcement learningArithmetic

Abstract

fetched live from OpenAlex

The focus of this paper is on the enhancement of Log Linear Learning (LLL) and Q-learning (QL) in game theory and their applications in multi-robot control. We first propose a modified Binary Log-Linear Learning (BLLL) algorithm that can achieve a better performance and higher learning rate when is compared to standard BLLL. However, due to a number of assumptions, practical applicability of a LLL-based algorithm is limited. To relax this limitation we then propose a modified QL algorithm that can achieve the same performance but with the price of lower learning rate. The algorithms proposed are tested numerically.

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.001
metaresearch head score (Gemma)0.004
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.766
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

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

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.052
GPT teacher head0.382
Teacher spread0.330 · 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