MétaCan
Menu
Back to cohort
Record W2493595568

Adaptive mutation for semi-separable problems

2001· article· en· W2493595568 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

VenueGenetic and Evolutionary Computation Conference · 2001
Typearticle
Languageen
FieldComputer Science
TopicInterconnection Networks and Systems
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsMutationTravelling salesman problemAdaptive mutationHeuristicOperator (biology)Computer scienceFitness landscapeMathematical optimizationMutation rateSeparable spaceGenetic algorithmMathematicsArtificial intelligenceAlgorithmBiologyGeneticsPopulation
DOInot available

Abstract

fetched live from OpenAlex

In this paper we introduce a new mutation heuristic in an attempt to better match genetic algorithms and the geography of search spaces. This is achieved by varying the mutation rate across the genotype to more rapidly search those areas that are currently believed to be having the greatest detrimental impact on the phenotype fitness. The new adaptive mutation operator is shown to be efficient in two applications: fault diagnosis in distributed and multiprocessor systems and the classical traveling salesman problem. We believe that the proposed, adaptive, mutation operator is the first step in realizing a new class of adaptive genetic operators for use with a distinct, but common, subset of real world applications.

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.925
Threshold uncertainty score0.517

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.033
GPT teacher head0.246
Teacher spread0.213 · 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