MétaCan
Menu
Back to cohort
Record W2786922041 · doi:10.1109/ssci.2017.8280938

Differential evolution with center-based mutation for large-scale optimization

2017· article· en· W2786922041 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsOntario Tech University
Fundersnot available
KeywordsBenchmark (surveying)Differential evolutionMutationCrossoverMathematical optimizationConvergence (economics)Dimension (graph theory)Scheme (mathematics)Computer scienceOptimization problemAlgorithmMathematicsArtificial intelligenceMathematical analysis

Abstract

fetched live from OpenAlex

The Differential Evolution (DE) is proved to be a successful approach for solving challenging optimization problems. However, its performance is degraded when solving high dimensional problems. Several significant enhancements of the DE have been proposed in recent years, including a variant of it with modified main operators (i.e., mutation and crossover). This paper proposes a center-based mutation scheme, which is based on the utilization of center of the gravity as a base vector. This mutation scheme aims to generate the candidate solution by using the center of three randomly selected candidate solutions. This new scheme is evaluated on CEC 2013 LSGO benchmark functions on the dimension 1000, as well as on fifteen shifted discrete benchmark functions on dimensions 500 and 1000. Experimental results confirm that the new scheme achieves a great success rate in comparison with the classical DE over the most of the test problems in terms of convergence rate and solution accuracy.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.298
Threshold uncertainty score0.664

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.000
Science and technology studies0.0010.000
Scholarly communication0.0010.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.020
GPT teacher head0.291
Teacher spread0.271 · 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