MétaCan
Menu
Back to cohort
Record W2122463624 · doi:10.1139/l03-014

Reinforcement learning: Introduction to theory and potential for transport applications

2003· article· en· W2122463624 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueCanadian Journal of Civil Engineering · 2003
Typearticle
Languageen
FieldSocial Sciences
TopicTransportation Planning and Optimization
Canadian institutionsnot available
Fundersnot available
KeywordsReinforcement learningComputer scienceIntelligent transportation systemField (mathematics)Key (lock)Domain (mathematical analysis)Control (management)Artificial intelligenceTransport engineeringEngineeringComputer security

Abstract

fetched live from OpenAlex

The aim of this paper is to develop insight into the potential of reinforcement learning (RL) agents and distributed reinforcement learning agents in the domain of transportation and traffic engineering and specifically in Intelligent Transport Systems (ITS). This paper provides a crystallized, comprehensive overview of the concept of RL and presents related successful applications in the field of traffic control and transportation engineering. It is divided into two parts: the first part provides a thorough overview of RL and its related methods and the second part reviews most recent applications of RL algorithms to the field of transportation engineering. Finally, it identifies many open research subjects in transportation in which the use of RL seems to be promising.Key words: reinforcement learning, machine learning, traffic control, artificial intelligence, intelligent transportation systems.

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.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.993
Threshold uncertainty score0.736

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0000.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.005
GPT teacher head0.210
Teacher spread0.205 · 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