MétaCan
Menu
Back to cohort
Record W1943814297 · doi:10.1109/cdc.1999.830249

Exponential convergence of an iterative learning controller for time-varying nonlinear systems

2003· article· en· W1943814297 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
TopicIterative Learning Control Systems
Canadian institutionsUniversité du Québec en Outaouais
Fundersnot available
KeywordsIterative learning controlNonlinear systemConvergence (economics)Exponential functionControl theory (sociology)Tracking errorController (irrigation)Computer scienceNorm (philosophy)Exponential growthMathematicsMathematical optimizationApplied mathematicsArtificial intelligenceControl (management)Mathematical analysis

Abstract

fetched live from OpenAlex

This paper addresses the issue of convergence rates in the tracking problem for a class of time varying nonlinear systems, using a PD-like iterative learning algorithm. It is shown that, under certain sufficient conditions involving the tracking horizon and the system parameters, the controller guarantees exponential convergence-with respect to the iteration index k-of the infinity norm of the tracking error. As a particular case, a class of linear time-varying systems is also considered, and sufficient conditions leading to exponential convergence are derived. The theoretical analysis, confirmed by the simulation results, demonstrates that the tracking horizon plays a crucial role in the convergence rates of the learning process.

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.596
Threshold uncertainty score0.841

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.008
GPT teacher head0.222
Teacher spread0.214 · 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

Citations13
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207