MétaCan
Menu
Back to cohort
Record W1990118068 · doi:10.1109/acc.2014.6859074

A minmax extremum-seeking control design technique

2014· article· en· W1990118068 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
FieldEngineering
TopicExtremum Seeking Control Systems
Canadian institutionsQueen's University
Fundersnot available
KeywordsMinimaxDitherControl theory (sociology)Mathematical optimizationA priori and a posterioriNonlinear systemControl (management)Optimal controlFunction (biology)Computer scienceAdaptive controlMathematics

Abstract

fetched live from OpenAlex

This paper considers the solution of a minmax optimization problem using adaptive extremum seeking control. It is assumed that the equations describing the dynamics of the nonlinear system and the cost function to be minimized are unknown and that the objective function is measured. The appropriate selection of the minimizing and the maximizing inputs is assumed to be known a priori. The proposed extremum-seeking control technique uses a time-varying estimation of the unknown gradients that minimizes the impact of the choice of dither signal on the performance of the extremum seeking control system. A simulation example is used to illustrate the effectiveness of the proposed technique.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.983
Threshold uncertainty score0.949

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.009
GPT teacher head0.183
Teacher spread0.174 · 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

Quick stats

Citations3
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicExtremum Seeking Control SystemsFrench-language works237,207