Revisiting Model Reference Adaptive Control: Linear-Like Closed-Loop Behavior
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.
Bibliographic record
Abstract
In this article, we examine the model reference adaptive control problem when the commonly used projection algorithm is utilized, subject to several common assumptions on the set of admissible parameters, in particular a compactness constraint as well as knowledge of the sign of the high-frequency gain. It is proven in the literature that for this setup, the closed-loop system is bounded-input bounded-state; since the closed-loop system is not linear time-invariant, this does not imply a bounded gain. Here, we prove a much crisper and detailed bound on the closed-loop behavior consisting of three terms: a decaying exponential on the initial condition, a linear-like convolution bound on the exogenous inputs, and a constant scaled by the square root of the constant in the denominator of the estimator update law; we also provide an upper bound on the two-norm of the tracking error. We then demonstrate that the same kind of bounds hold in the presence of a degree of unmodeled dynamics and plant parameter time-variation.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it