MétaCan
Menu
Back to cohort

EFWA as a Method of Optimizing Model Parameters

2020· book-chapter· en· W3016094269 on OpenAlexaff
Daniel C. Lee, Katherine Manson

Bibliographic record

VenueAdvances in computational intelligence and robotics book series · 2020
Typebook-chapter
Languageen
FieldEngineering
TopicSensorless Control of Electric Motors
Canadian institutionsBritish Columbia Institute of TechnologySimon Fraser University
Fundersnot available
KeywordsKalman filterExtended Kalman filterControl theory (sociology)Computer scienceGenetic algorithmCovarianceNoise (video)Set (abstract data type)Induction motorVariable (mathematics)AlgorithmEngineeringMathematicsControl (management)Artificial intelligenceStatisticsMachine learning

Abstract

fetched live from OpenAlex

The Fireworks Algorithm (EFWA) is studied as a method to optimize the noise covariance parameters in an induction motor system model to control the motor speed without a speed sensor. The authors considered a system that employs variable frequency drives (VFDs) and executes an extended Kalman filter (EKF) algorithm to estimate the motor speed based on other measured values. Multiple optimizations were run, and the authors found that the EFWA optimization provided, on average, better solutions than the Genetic Algorithm (GA) for a comparable number of parameter set trials. However, EFWA parameters need to be selected carefully; otherwise, EFWA's early performance advantage over GA can be lost.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
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.0030.001

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.024
GPT teacher head0.272
Teacher spread0.249 · 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
GenreMethods

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

Citations0
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueAdvances in computational intelligence and robotics book seriesSame topicSensorless Control of Electric MotorsFrench-language works237,207