MétaCan
Menu
Back to cohort
Record W4285137408 · doi:10.1109/tmag.2022.3184246

Reinforcement Learning for Topology Optimization of a Synchronous Reluctance Motor

2022· article· en· W4285137408 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

VenueIEEE Transactions on Magnetics · 2022
Typearticle
Languageen
FieldEngineering
TopicTopology Optimization in Engineering
Canadian institutionsMcGill University
Fundersnot available
KeywordsReinforcement learningComputer scienceNetwork topologyTask (project management)Topology optimizationComputationArtificial neural networkMagnetic reluctanceGenetic algorithmDomain (mathematical analysis)Finite element methodTopology (electrical circuits)Artificial intelligenceMachine learningAlgorithmEngineeringMathematics

Abstract

fetched live from OpenAlex

In this article, a method for topology optimization (TO) of a synchronous reluctance motor (SynRM) is proposed using deep reinforcement learning (RL). Due to the need for simulating a large number of finite-element models in a traditional TO task, incorporating a study involving a different problem formulation (such as a varying design domain) can be an overwhelming task. A neural network (NN)-based agent trained using an RL formulation is able to extend the knowledge from one TO design problem to other similar TO tasks. The applicability of such learning is performed using a sequence-based TO environment. It is observed that such an approach not only reduces the computation required for TO, but also introduces the capability to generalize RL to unseen TO scenarios. The proposed optimization method reduces computation time by 70%–90% when compared to a genetic algorithm-based implementation.

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: none
Teacher disagreement score0.939
Threshold uncertainty score0.828

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.007
GPT teacher head0.205
Teacher spread0.199 · 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