MétaCan
Menu
Back to cohort
Record W2028913248 · doi:10.1109/ia.2014.7009455

Naïve creature learns to cross a highway in a simulated CA-like environment

2014· article· en· W2028913248 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
TopicCellular Automata and Applications
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsCreaturesComputer sciencePopulationProcess (computing)Artificial intelligenceBase (topology)Human–computer interactionNatural (archaeology)SociologyGeography

Abstract

fetched live from OpenAlex

We present a model of simple cognitive agents, called “creatures”, and their learning process, a type of “social observational learning”, that is each creature learns from the behaviour of other creatures. The creatures may experience fear and/or desire, and are capable of evaluating if a strategy has been applied successfully and of applying this strategy again with small changes to a similar but new situation. The creatures are born as “tabula rasa”; i.e. without built-in knowledge base of their environment and as they learn they build this knowledge base. We study learning outcomes of a population of such creatures when they are learning how to safely cross various types of highways. The highways are implemented as a modified Nagel-Schreckenberg model, a CA based highway model, and each creature is provided with mechanism to reason to cross safely the highway. We present selected simulation results and their analysis.

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 categoriesInsufficient payload (model declined to judge)
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.701
Threshold uncertainty score0.999

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.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.002

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.249
Teacher spread0.238 · 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

Citations8
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicCellular Automata and ApplicationsFrench-language works237,207