MétaCan
Menu
Back to cohort
Record W275567961

Knowledge Sharing Through Agent Migration with Multi-Population Cultural Algorithm.

2013· article· en· W275567961 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

VenueThe Florida AI Research Society · 2013
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsComputer scienceKnowledge transferPopulationAlgorithmMulti-agent systemKnowledge sharingSpace (punctuation)Machine learningArtificial intelligenceKnowledge management
DOInot available

Abstract

fetched live from OpenAlex

This study presents a new method for knowledge transfer in Multi-Population Cultural Algorithms (MPCA) through agent migration. This agent-based algorithm involves having individual agents using one of multiple pre-defined knowledge algorithms to de-termine behavior, and using the success of it and other agents to decide on which knowledge algorithms to use next. Two or more subpopulations with their own knowledge algorithm are created. The agents work in the same environment by only communicating with agents within their own subpopulation, and with two global belief spaces monitoring the effectiveness of each subpopulation. Agents transfer between the sub-populations regularly to further improve individual success. We use the cone’s world problem as test-bed. Experimental results reveal the impact of indi-vidual knowledge transfer on the target subpopula-tion’s belief space.

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.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.965
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0020.002
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.123
GPT teacher head0.401
Teacher spread0.278 · 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