MétaCan
Menu
Back to cohort
Record W2570355113 · doi:10.1080/0952813x.2016.1264088

Comparisons of several variants of continuous quantum-inspired evolutionary algorithms

2017· article· en· W2570355113 on OpenAlexaff
Ahmad Mozaffari, Mahdi Emami, Nasser L. Azad, Alireza Fathi

Bibliographic record

VenueJournal of Experimental & Theoretical Artificial Intelligence · 2017
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Reservoir Computing
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceScalabilityRobustness (evolution)Evolutionary algorithmChaoticCurse of dimensionalityQuantumConvergence (economics)AlgorithmExploitContext (archaeology)Sensitivity (control systems)Domain (mathematical analysis)Mathematical optimizationTheoretical computer scienceArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

In this study, an extensive numerical analysis is carried out to investigate the effects of different quantum-based operators on the performance of continuous quantum-inspired evolutionary algorithms (QEAs). In this context, different variants of quantum-inspired evolutionary operators are adopted for numerical simulations. Furthermore, some novel chaos-enhanced QEAs are proposed and their performances are evaluated through the numerical comparative study. Based on evaluating the accuracy, robustness, convergence, scalability and sensitivity to initialisation of the rival methods, it is indicated that the algorithmic structure of QEAs is prone to being combined with chaotic maps. The results demonstrate that chaotically implemented QEAs can effectively explore/exploit the solution spaces of different landscapes and dimensionality, and finally, converge to acceptable regions within the solution domain.

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.002
metaresearch head score (Gemma)0.005
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: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
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.044
GPT teacher head0.327
Teacher spread0.284 · 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

Citations5
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Experimental & Theoretical Artificial IntelligenceSame topicNeural Networks and Reservoir ComputingFrench-language works237,207