A finite-sample bound for identifying partially observed linear switched systems from a single trajectory

We derive a finite-sample probabilistic bound on the parameter estimation error of a system identification algorithm for Linear Switched Systems. The algorithm estimates Markov parameters from a single trajectory and applies a variant of the Ho-Kalman algorithm to recover the system matrices. Our bound guarantees statistical consistency under the assumption that the true system exhibits quadratic stability. The proof leverages the theory of weakly dependent processes. To the best of our knowledge, this is the first finite-sample bound for this algorithm in the single-trajectory setting.

@article{racz2025_2503.13766,
  title={ A finite-sample bound for identifying partially observed linear switched systems from a single trajectory },
  author={ Daniel Racz and Mihaly Petreczky and Balint Daroczy },
  journal={arXiv preprint arXiv:2503.13766},
  year={ 2025 }
}