MétaCan
Menu
Back to cohort
Record W4413217398 · doi:10.1145/3712255.3726593

A Constrained Multi-objective Co-Evolutionary Algorithm Based on Operator Score and Reward

2025· article· en· W4413217398 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 · 2025
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsArtificial Intelligence in Medicine (Canada)
Fundersnot available
KeywordsComputer scienceOperator (biology)Evolutionary algorithmEvolutionary computationMathematical optimizationArtificial intelligenceMathematicsBiology

Abstract

fetched live from OpenAlex

This kind of algorithm composed of multiple operators, when solving different constrained multi-objective optimization problems (CMOPs), always has operators with good effects guiding the population to seek a better Pareto Front (PF). However, in the evolutionary process of such algorithms, there exist operators that have no effect but still generate offspring, thereby slowing down the convergence speed of the algorithm. To accelerate the convergence speed of the algorithm, a constrained multi-objective co-Evolutionary algorithm based on operator score and reward (SRCA) is presented in this paper, this SRCA algorithm has proposed an operator evaluation and operator reward mechanism which attempt to select operators that are beneficial to the convergence and diversity of the population for reproduction. The experimental results demonstrate that SRCA algorithm can effectively expedite the convergence speed and enhance the diversity of the population.

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

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.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.017
GPT teacher head0.263
Teacher spread0.245 · 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