The sample complexity of worst-case identification of FIR linear systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5773500
- scientific article; zbMATH DE number 806815
- Worst-case errors of linear algorithms for identification in H
- Optimality properties in finite sample li identification with bounded noise
- Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
Cites work
- scientific article; zbMATH DE number 4204258 (Why is no real title available?)
- scientific article; zbMATH DE number 4207908 (Why is no real title available?)
- scientific article; zbMATH DE number 3908323 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 3406955 (Why is no real title available?)
- Analysis of linear methods for robust identification in \(\ell_ 1\)
- 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
- Optimal algorithms theory for robust estimation and prediction
- Optimal asymptotic identification under bounded disturbances
- Robust convergence of two-stage nonlinear algorithms for identification in \({\mathcal H}_ \infty\)
- Robust identification and Galois sequences
- Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
Cited in
(24)- Modelling of uncertain systems via linear programming
- Complexity of identification of linear systems with rational transfer functions
- Sample complexity of worst-case H^-identification
- On the sample-complexity of \({\mathcal H}_\infty\) identification
- Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
- Estimation of model quality
- Finite time identification in unstable linear systems
- Worst-case control-relevant identification
- scientific article; zbMATH DE number 5773500 (Why is no real title available?)
- The least-squares identification of FIR systems subject to worst-case noise
- Fractional covers for convolution products
- Analysis of linear methods for robust identification in \(\ell_ 1\)
- Closed-loop persistent identification of linear systems with unmodeled dynamics and stochastic disturbances
- Properties of least squares estimates in set membership identification
- scientific article; zbMATH DE number 7625185 (Why is no real title available?)
- Necessary and sufficient conditions for robust identification of uncertain LTIstems
- On the optimal worst-case experiment design for constrained linear systems
- Worst-case identification of nonlinear fading memory systems
- Space and time complexities and sensor threshold selection in quantized identification
- On the worst-case divergence of the least-squares algorithm
- Convergence analysis of central and minimax algorithms in scalar regressor models
- Worst-case analysis of the least-squares method and related identification methods
- Uncertainty, information and complexity in identification and control
- Fast identification n-widths and uncertainty principles for LTI and slowly varying systems
This page was built for publication: The sample complexity of worst-case identification of FIR linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803842)
