MétaCan
Menu
Back to cohort
Record W2330289077 · doi:10.2514/6.2014-1486

Surrogate-assisted Self-accelerated Particle Swarm Optimization

2014· article· en· W2330289077 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
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsParticle swarm optimizationSurrogate modelComputer scienceMathematical optimizationAlgorithmMathematicsMachine learning

Abstract

fetched live from OpenAlex

Surrogate-assisted self-accelerated particle swarm optimization (SASA-PSO) is a major modification of an original PSO which uses all previously evaluated particles aiming to increase the computational efficiency. A newly in-house developed metamodeling approach named high dimensional model representation with principal component analysis (PCAHDMR), which was specifically established for so called high-dimensional, expensive, blackbox (HEB) problems, is used to approximate a function using all particles calculated during the optimization process. Then, based on the minimum of the constructed metamodel, a term called “metamodeling acceleration” is added to the velocity update formula in the original PSO algorithm. The proposed optimization algorithm performance is investigated using several benchmark problems with different number of variables and the results are also compared with original PSO results. Preliminary results show a considerable performance improvement in terms of number of function evaluations as well as achieved global optimum specifically for high-dimensional problems.

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.270
Threshold uncertainty score0.648

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.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.018
GPT teacher head0.254
Teacher spread0.236 · 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