Minimal Order Recovery through Rank-adaptive Identification
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915541977923584 |
|---|---|
| author | Zheng, Frédéric Jedra, Yassir Proutière, Alexandre |
| author_facet | Zheng, Frédéric Jedra, Yassir Proutière, Alexandre |
| contents | This paper addresses the problem of identifying linear systems from noisy input-output trajectories. We introduce Thresholded Ho-Kalman, an algorithm that leverages a rank-adaptive procedure to estimate a Hankel-like matrix associated with the system. This approach optimally balances the trade-off between accurately inferring key singular values and minimizing approximation errors for the rest. We establish finite-sample Frobenius norm error bounds for the estimated Hankel matrix. Our algorithm further recovers both the system order and its Markov parameters, and we provide upper bounds for the sample complexity required to identify the system order and finite-time error bounds for estimating the Markov parameters. Interestingly, these bounds match those achieved by state-of-the-art algorithms that assume prior knowledge of the system order. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_08720 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Minimal Order Recovery through Rank-adaptive Identification Zheng, Frédéric Jedra, Yassir Proutière, Alexandre Systems and Control This paper addresses the problem of identifying linear systems from noisy input-output trajectories. We introduce Thresholded Ho-Kalman, an algorithm that leverages a rank-adaptive procedure to estimate a Hankel-like matrix associated with the system. This approach optimally balances the trade-off between accurately inferring key singular values and minimizing approximation errors for the rest. We establish finite-sample Frobenius norm error bounds for the estimated Hankel matrix. Our algorithm further recovers both the system order and its Markov parameters, and we provide upper bounds for the sample complexity required to identify the system order and finite-time error bounds for estimating the Markov parameters. Interestingly, these bounds match those achieved by state-of-the-art algorithms that assume prior knowledge of the system order. |
| title | Minimal Order Recovery through Rank-adaptive Identification |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2506.08720 |