On the sample-complexity of ?? identification
From MaRDI portal
Publication:2730989
DOI10.1002/rnc.623zbMath0972.93016OpenAlexW1589966718MaRDI QIDQ2730989
Munther A. Dahleh, Saligrama Venkatesh
Publication date: 7 November 2001
Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rnc.623
system identificationrobust controlnon-stationary\({\mathcal H}_\infty\) distancediscrete time linear time-invariant stable systemsfinitely parametrized familyinfinite sample complexity
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the value of information in system identification-bounded noise case
- Information-based complexity and nonparamteric worst-case system identification
- Model quality evaluation in set membership identification
- The sample complexity of worst-case identification of FIR linear systems
- Analysis of linear methods for robust identification in \(\ell_ 1\)
- Worst-case control-relevant identification
- Persistent identification of systems with unmodeled dynamics and exogenous disturbances
- Optimal asymptotic identification under bounded disturbances
- Set-membership identification of systems with parametric and nonparametric uncertainty
- On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous time
- On the time complexity of worst-case system identification
- A normality theorem for decentralized control of discrete-event systems
- On autoregressive models, the parsimony principle, and their use in control-oriented system identification
- Identification in the presence of classes of unmodeled dynamics and noise
- Robustness analysis of uncertain linear singular systems with output feedback control
- On system identification of complex systems from finite data
This page was built for publication: On the sample-complexity of ?? identification
