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 OpenAlexaff
Kambiz Haji Hajikolaei, Amir Safari, Gaofeng Wang, Hirpa G. Lemu

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.

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.001
metaresearch head score (Gemma)0.002
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: none
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.000
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.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

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

Citations4
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Multi-Objective Optimization AlgorithmsFrench-language works237,207