MétaCan
Menu
Back to cohort
Record W2065942352 · doi:10.1002/rnc.1165

Real‐time optimization of dynamic systems using multiple units

2007· article· en· W2065942352 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

VenueInternational Journal of Robust and Nonlinear Control · 2007
Typearticle
Languageen
FieldEngineering
TopicExtremum Seeking Control Systems
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsConvergence (economics)Control theory (sociology)Lyapunov functionPerturbation (astronomy)Computer scienceDimension (graph theory)Mathematical optimizationGradient methodSimple (philosophy)Function (biology)Scheme (mathematics)MathematicsApplied mathematicsNonlinear systemControl (management)Mathematical analysis

Abstract

fetched live from OpenAlex

Abstract Model‐free, unconstrained, real‐time optimization of the operating point of a dynamic system involves forcing the gradient of the cost function to zero. In these methods, gradient estimation is a key issue, for which methods that perturb the input over time are used. The main limitation of these methods is that they require the dynamics of the adaptation to be two orders of magnitude slower than the system dynamics. To circumvent this limitation, a novel, simple, yet effective way of estimating the gradient is presented in this paper. Multiple identical units with non‐identical inputs are used and the gradient is computed via finite difference. Thus, the perturbation is along the ‘unit dimension’, thereby allowing a faster adaptation. The convergence of the scheme is rigorously established via Lyapunov analysis. An illustrative example is provided where the proposed scheme resulted in an 100‐fold improvement in the time needed for convergence. Copyright © 2007 John Wiley & Sons, Ltd.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.692
Threshold uncertainty score0.448

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.011
GPT teacher head0.230
Teacher spread0.219 · 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