Minimal Order Recovery through Rank-adaptive Identification
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Time-Varying Graph Signal Recovery Using High-Order Smoothness and Adaptive Low-rankness
Time-varying graph signal recovery has been widely used in many applications, including climate change, environmental hazard monitoring, and epidemic studies. It is crucial to choose appropriate regularizations to descri…
Lattice partition recovery with dyadic CART
We study piece-wise constant signals corrupted by additive Gaussian noise over a $d$-dimensional lattice. Data of this form naturally arise in a host of applications, and the tasks of signal detection or testing, de-nois…
regressionThe Power of Complementary Regularizers: Image Recovery via Transform Learning and Low-Rank Modeling
Recent works on adaptive sparse and on low-rank signal modeling have demonstrated their usefulness in various image / video processing applications. Patch-based methods exploit local patch sparsity, whereas other works a…
compressed sensingComputational EfficiencyDenoisingDictionary Learning+3Robust Spectral Compressed Sensing via Structured Matrix Completion
The paper explores the problem of \emph{spectral compressed sensing}, which aims to recover a spectrally sparse signal from a small random subset of its $n$ time domain samples. The signal of interest is assumed to be a …
compressed sensingMatrix CompletionSuper-ResolutionA Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Completion
Matrix learning is at the core of many machine learning problems. A number of real-world applications such as collaborative filtering and text mining can be formulated as a low-rank matrix completion problem, which recov…
Collaborative FilteringLow-Rank Matrix CompletionMatrix Completion