MétaCan
Menu
Back to cohort
Record W4294811509 · doi:10.1109/cec55065.2022.9870413

Methods to Detect and Address Stall in Particle Swarm Optimization

2022· article· en· W4294811509 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venue2022 IEEE Congress on Evolutionary Computation (CEC) · 2022
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsParticle swarm optimizationMathematical optimizationComputer scienceSwarm behaviourStall (fluid mechanics)Multi-swarm optimizationModalRegular polygonMathematicsEngineeringAerospace engineering

Abstract

fetched live from OpenAlex

Particle Swarm Optimization can experience stall in multi-modal search spaces. A stalled swarm is unable to converge and unable to find better solutions because all of its exploratory search solutions are rejected. Remedies to address the stall condition can benefit from knowing the particles that are still performing exploration, so we develop an efficient and accurate real-time, search space independent method to identify these particles. We confirm the benefit of identifying stalled particles through a modification designed for globally convex search spaces. We also discuss opportunities to differentiate search space landscapes and propose future research that can address non-globally convex search spaces.

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 categoriesMeta-epidemiology (narrow)
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.169
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.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.036
GPT teacher head0.345
Teacher spread0.309 · 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