Computationally‐Light Non‐Lifted Data‐Driven Norm‐Optimal Iterative Learning Control
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
Abstract Computational complexity and model dependence are two significant limitations on lifted norm optimal iterative learning control (NOILC). To overcome these two issues and retain monotonic convergence in iteration, this paper proposes a computationally‐efficient non‐lifted NOILC strategy for nonlinear discrete‐time systems via a data‐driven approach. First, an iteration‐dependent linear representation of the controlled nonlinear process is introduced by using a dynamical linearization method in the iteration direction. The non‐lifted NOILC is then proposed by utilizing the input and output measurements only, instead of relying on an explicit model of the plant. The computational complexity is reduced by avoiding matrix operation in the learning law. This greatly facilitates its practical application potential. The proposed control law executes in real‐time and utilizes more control information at previous time instants within the same iteration, which can help improve the control performance. The effectiveness of the non‐lifted data‐driven NOILC is demonstrated by rigorous analysis along with a simulation on a batch chemical reaction 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 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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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