English

Canonical Bayesian Linear System Identification

Machine Learning 2025-08-29 v2 Machine Learning Systems and Control Systems and Control Computation

Abstract

Standard Bayesian approaches for linear time-invariant (LTI) system identification are hindered by parameter non-identifiability; the resulting complex, multi-modal posteriors make inference inefficient and impractical. We solve this problem by embedding canonical forms of LTI systems within the Bayesian framework. We rigorously establish that inference in these minimal parameterizations fully captures all invariant system dynamics (e.g., transfer functions, eigenvalues, predictive distributions of system outputs) while resolving identifiability. This approach unlocks the use of meaningful, structure-aware priors (e.g., enforcing stability via eigenvalues) and ensures conditions for a Bernstein--von Mises theorem -- a link between Bayesian and frequentist large-sample asymptotics that is broken in standard forms. Extensive simulations with modern MCMC methods highlight advantages over standard parameterizations: canonical forms achieve higher computational efficiency, generate interpretable and well-behaved posteriors, and provide robust uncertainty estimates, particularly from limited data.

Keywords

Cite

@article{arxiv.2507.11535,
  title  = {Canonical Bayesian Linear System Identification},
  author = {Andrey Bryutkin and Matthew E. Levine and Iñigo Urteaga and Youssef Marzouk},
  journal= {arXiv preprint arXiv:2507.11535},
  year   = {2025}
}

Comments

46 pages, 9 figures

R2 v1 2026-07-01T04:02:49.911Z