The sample complexity of worst-case identification of FIR linear systems

DOI10.1016/0167-6911(93)90057-DzbMath0769.93024MaRDI QIDQ1803842

John N. Tsitsiklis, Munther A. Dahleh, Theodore V. Theodosopoulos

Publication date: 29 June 1993

Published in: Systems \& Control Letters (Search for Journal in Brave)

zbMATH Keywords

worst-case identification; finite impulse response; sample complexity

Mathematics Subject Classification ID

93B30: System identification

93C05: Linear systems in control theory

Related Items

Worst-case analysis of the least-squares method and related identification methods, Convergence analysis of central and minimax algorithms in scalar regressor models, On the worst-case divergence of the least-squares algorithm, Complexity of identification of linear systems with rational transfer functions, Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms, The least-squares identification of FIR systems subject to worst-case noise, Sample complexity of worst-case \(H^\infty\)-identification, Closed-loop persistent identification of linear systems with unmodeled dynamics and stochastic disturbances, Properties of least squares estimates in set membership identification, Worst-case identification of nonlinear fading memory systems, Analysis of linear methods for robust identification in \(\ell_ 1\), Estimation of model quality, Worst-case control-relevant identification, Modelling of uncertain systems via linear programming, Fractional covers for convolution products, Necessary and sufficient conditions for robust identification of uncertain LTIstems, Space and time complexities and sensor threshold selection in quantized identification, Unnamed Item, On the sample-complexity of ?? identification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust convergence of two-stage nonlinear algorithms for identification in \({\mathcal H}_ \infty\)
• Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
• Analysis of linear methods for robust identification in \(\ell_ 1\)
• Optimal asymptotic identification under bounded disturbances
• Optimal algorithms theory for robust estimation and prediction
• Robust identification and Galois sequences
• Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
• Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
• On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous time