PAC-Bayesian Bounds for Learning Partially Observed Stochastic Linear Time-Invariant State-Space Systems with Inputs and Sub-Gaussian Noise
Not on the map. Why?
Abstract (arXiv)
In this paper we derive a Probably Approximately Correct (PAC)-Bayesian error bound for partially observed linear time-invariant (LTI) stochastic dynamical systems in state-space form with inputs and sub-Gaussian noise. Such bounds are widespread in machine learning, and they are useful for characterizing the predictive power of models learned from finitely many data points. The bound derived in this paper relates the expectation of prediction errors with the prediction error generated by the model on the data used for learning. In addition, we show that it can also be used to derive bounds for the parameter estimation error. In turn, this allows us to provide finite-sample error bounds for the prediction error and parameter estimation error for a wide class of system identification algorithms. Furthermore, as LTI systems are a sub-class of recurrent neural networks (RNNs), these error bounds could be a first step towards PAC-Bayesian bounds for RNNs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 44 references that are in the map. First posted on arXiv 8 Sep 2026.
Builds on
3 of 44 references.
References · 3
- 2021User-friendly introduction to PAC-Bayes boundscited by 239
- 2019A Primer on PAC-Bayesian Learningcited by 132
- 2023PAC-Bayesian bounds for learning LTI-ss systems with input from empirical losscited by 4
Built on by
Not cited yet.