Pith. sign in

REVIEW 2 cited by

Non-Asymptotic Analysis of Robust Control from Coarse-Grained Identification

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1707.04791 v2 pith:JKRO4PZT submitted 2017-07-15 math.OC cs.LG

classification math.OCcs.LG
keywords controlsysteminputmodelsobjectivesaccuratelyanalysisapproximation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Boosting-Enabled Robust System Identification of Partially Observed LTI Systems Under Heavy-Tailed Noise

    eess.SY 2025-04 accept novelty 6.0 of 10

    A bucket-and-boost estimator using least squares and a geometric median recovers the first T Markov parameters of an LTI system under heavy-tailed noise with O(sqrt(p log(1/delta)/N)) error and O((mT)^2 kappa log(1/de...

  2. Non-asymptotic Closed-Loop System Identification using Autoregressive Processes and Hankel Model Reduction

    eess.SY 2019-09 conditional novelty 6.0 of 10

    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).

Pith tools