MétaCan
Menu
Back to cohort
Record W2145224703

The AID Method for Global Optimization

2011· article· en· W2145224703 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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueAlgorithmic operations research · 2011
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsMathematical optimizationGlobal optimizationBenchmark (surveying)MinificationComputer sciencePopulationDiversification (marketing strategy)Function (biology)MathematicsBiology
DOInot available

Abstract

fetched live from OpenAlex

An Alternating Intensification/Diversification (AID) method is proposed to tackle global optimization problems, focu sing here on global function minimization over continuous varia bles. Our method is a local search procedure that is particul arly easy to implement, and can readily be embedded as a supportin g strategy within more sophisticated methods that make use of population-based designs. We perform computationaltests comparing the AID method to 20 other algorithms, many of them representing a similar or higher level of sophis tication, on a total of 28 benchmark functions. The results show that the new approach generally obtains good quality so lutions for unconstrained global optimization problems, suggesting the utility of its underlying notions and the pot ential value of exploiting its multiple avenues for general ization.

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.006
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Scholarly 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.867
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0060.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0020.000
Scholarly communication0.0010.001
Open science0.0020.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.130
GPT teacher head0.427
Teacher spread0.296 · 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