MétaCan
Menu
Back to cohort
Record W2118318258 · doi:10.1109/have.2008.4685299

Generation of rule-based adaptive strategies for a collaborative virtual simulation environment

2008· article· en· W2118318258 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
TopicEvolutionary Algorithms and Applications
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceAdaptabilityArtificial intelligenceMachine learningClassifier (UML)Learning classifier systemAdaptive learningUnsupervised learning

Abstract

fetched live from OpenAlex

Real Time Strategy Games (RTSG) are a strong test bed for AI research, particularly on the subject of unsupervised learning. They offer a challenging, dynamic environment with complex problems that often have no perfect solutions. Learning classifier systems are rule-based machine learning techniques that rely on a genetic algorithm to discover a knowledge map used to classify an input space into a set of actions. This paper focuses on the use of accuracy-based learning classifier system (XCS) as the learning mechanism for generating adaptive strategies in a real time strategy game. The performance and adaptability of the developed strategies with the XCS is analyzed by facing these against scripted opponents on an open source game called Wargus. Results show that the XCS module is able to learn adaptive strategies effectively and achieve the objectives of each training scenario.

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

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.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.065
GPT teacher head0.269
Teacher spread0.203 · 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

Citations1
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207