MétaCan
Menu
Back to cohort
Record W2021984249 · doi:10.1142/s0129626407003034

COMPARING MINIMUM NEIGHBORHOOD EVALUATION SCHEMES FOR FINDING SPATIALLY ROBUST SOLUTIONS

2007· article· en· W2021984249 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

VenueParallel Processing Letters · 2007
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Guelph
FundersNational Science Council
KeywordsRobustness (evolution)Fitness functionMathematical optimizationNeighbourhood (mathematics)Computer scienceAlgorithmMathematicsGenetic algorithm

Abstract

fetched live from OpenAlex

The common definition for robust solutions considers a solution robust if it remains optimal when the parameters defining the fitness function are perturbed. A second definition that can be found in the literature: robustness occurs when a solution can be varied spatially without a significant drop in fitness. We propose an alternative operational definition for spatial robustness: both the solution and the neighbourhood around the solution has fitness above a given threshold. With this new definition, we created a set of functions with useful properties to allow for the testing of solution robustness. The performance of a Genetic Algorithm (GA) is then evaluated based on its ability to identify multiple robust solutions based on the above robustness definition. Different neighbourhood evaluation schemes are identified from the literature and compared, with the minimum neighbour technique proving to be the most effective.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
Open science0.0010.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.085
GPT teacher head0.320
Teacher spread0.235 · 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