MétaCan
Menu
Back to cohort
Record W4285805253 · doi:10.1145/3520304.3529043

Regulatory genotype-to-phenotype mappings improve evolvability in genetic programming

2022· article· en· W4285805253 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

VenueProceedings of the Genetic and Evolutionary Computation Conference Companion · 2022
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsQueen's University
Fundersnot available
KeywordsEvolvabilityRobustness (evolution)PhenotypeGenetic programmingFitness landscapeNoveltyComputer scienceGenotypeBiologyGrammatical evolutionNeutral networkComputational biologyGeneticsGeneArtificial intelligencePopulation

Abstract

fetched live from OpenAlex

Most genotype-to-phenotype mappings in EAs are redundant, i.e., multiple genotypes can map to the same phenotype. Phenotypes are accessible from one to another through point mutations. However, these mutational connections can be unevenly distributed among phenotypes. Quantitative analysis of such connections helps better characterize the robustness and evolvability of an EA. In this study, we propose two genotype-to-phenotype mapping mechanisms for linear genetic programming (LGP), where the execution and output of a linear genetic program are varied by a regulator. We investigate how such regulatory mappings can alter the genotypic connections among different phenotypes and the robustness and evolvability of phenotypes. We also compare the search ability of LGP using the conventional mapping versus the regulatory mappings, and observe that the regulatory mappings improve the efficiency in all three search scenarios, including random walk, hill climbing, and novelty search.

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: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.426
Threshold uncertainty score0.699

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.001
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.014
GPT teacher head0.227
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