MétaCan
Menu
Back to cohort
Record W3005942432 · doi:10.23977/cpcs.2020.41001

A hybrid algorithm based on cuckoo search and differential evolution for numerical optimization

2020· article· en· W3005942432 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueComputing Performance and Communication systems · 2020
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsnot available
Fundersnot available
KeywordsCuckoo searchDifferential evolutionBenchmark (surveying)Mathematical optimizationEvolutionary algorithmLocal search (optimization)AlgorithmMetaheuristicMeta-optimizationComputer scienceOptimization problemGlobal optimizationEvolutionary computationPopulationCuckooMathematicsParticle swarm optimization

Abstract

fetched live from OpenAlex

Cuckoo search (CS) is a new intelligent bionic algorithm, but it is easy to fall into the local optimum. In this paper, a hybrid algorithm based on cuckoo search and differential evolution (CSDE) is proposed. In the global optimization, a control factor is introduced to judge the optimization state of CS, further determine whether it is necessary to combine the differential strategy to improve the population diversity. Besides, different evolutionary strategies are used to enhance the local search. Numerical experiments, carried on 28 benchmark functions from CEC 2013, demonstrate that CSDE successfully achieves better optimization performance than other competitive optimization algorithms.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.758
Threshold uncertainty score0.595

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.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
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.034
GPT teacher head0.276
Teacher spread0.242 · 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