Probabilistic learning of nonlinear dynamical systems using sequential Monte Carlo
Thomas B. Sch\"on, Andreas Svensson, Lawrence Murray, Fredrik Lindsten

TL;DR
This paper introduces the particle Metropolis–Hastings algorithm for probabilistic learning of nonlinear dynamical systems, emphasizing its convergence guarantees and practical implementation via a specialized modeling language.
Contribution
It presents a comprehensive tutorial on the particle Metropolis–Hastings method, highlighting its advantages for learning nonlinear state-space models from data.
Findings
Guaranteed convergence to the true solution under mild assumptions
Practical implementation using a dedicated modeling language
Illustrative numerical example demonstrating the method
Abstract
Probabilistic modeling provides the capability to represent and manipulate uncertainty in data, models, predictions and decisions. We are concerned with the problem of learning probabilistic models of dynamical systems from measured data. Specifically, we consider learning of probabilistic nonlinear state-space models. There is no closed-form solution available for this problem, implying that we are forced to use approximations. In this tutorial we will provide a self-contained introduction to one of the state-of-the-art methods---the particle Metropolis--Hastings algorithm---which has proven to offer a practical approximation. This is a Monte Carlo based method, where the particle filter is used to guide a Markov chain Monte Carlo method through the parameter space. One of the key merits of the particle Metropolis--Hastings algorithm is that it is guaranteed to converge to the "true…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
