MétaCan
Menu
Back to cohort
Record W3191597211 · doi:10.1109/cec45853.2021.9504812

An Exploration-only Exploitation-only Hybrid for Large Scale Global Optimization

2021· article· en· W3191597211 on OpenAlexaff
Antonio Bolufé-Röhler, Dania Tamayo-Vera

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsUniversity of Prince Edward Island
Fundersnot available
KeywordsBenchmark (surveying)Computer scienceMathematical optimizationSelection (genetic algorithm)PopulationConvergence (economics)MetaheuristicScale (ratio)Artificial intelligenceMathematicsGeographyEconomics

Abstract

fetched live from OpenAlex

Two factors affect the effectiveness of exploration, the bias introduced by selection and the concurrence of exploration and exploitation. The Leaders and Followers metaheuristic was designed to reduce the bias from selection by using a two-population scheme. Minimum Population Search was designed to limit the concurrence of exploration and exploitation through the use of Thresheld Convergence in its sampling strategy. This paper presents Unbiased Exploratory Search, which combines both approaches and simultaneously addresses the effects of these two factors. An exploration-only exploitation-only hybrid is then presented using Unbiased Exploratory Search for the exploration-only phase of the hybrid. The hybrid is tested on the CEC large scale optimization benchmark.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.003

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.037
GPT teacher head0.330
Teacher spread0.293 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicMetaheuristic Optimization Algorithms ResearchFrench-language works237,207