For closed-loop data, the REDAR algorithm (VARX fit plus balanced reduction) has one-step-ahead prediction error bounded by the optimal error plus terms that decay with model order p and with sample size T as O(1/√T).
Non-Asymptotic Analysis of Robust Control from Coarse-Grained Identification
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This work explores the trade-off between the number of samples required to accurately build models of dynamical systems and the degradation of performance in various control objectives due to a coarse approximation. In particular, we show that simple models can be easily fit from input/output data and are sufficient for achieving various control objectives. We derive bounds on the number of noisy input/output samples from a stable linear time-invariant system that are sufficient to guarantee that the corresponding finite impulse response approximation is close to the true system in the $\mathcal{H}_\infty$-norm. We demonstrate that these demands are lower than those derived in prior art which aimed to accurately identify dynamical models. We also explore how different physical input constraints, such as power constraints, affect the sample complexity. Finally, we show how our analysis fits within the established framework of robust control, by demonstrating how a controller designed for an approximate system provably meets performance objectives on the true system.
citation-role summary
citation-polarity summary
fields
eess.SY 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Non-asymptotic Closed-Loop System Identification using Autoregressive Processes and Hankel Model Reduction
For closed-loop data, the REDAR algorithm (VARX fit plus balanced reduction) has one-step-ahead prediction error bounded by the optimal error plus terms that decay with model order p and with sample size T as O(1/√T).