Unsupervised Learning of Sampling Distributions for Particle Filters
Fernando Gama, Nicolas Zilberstein, Martin Sevilla, Richard Baraniuk,, Santiago Segarra

TL;DR
This paper introduces four unsupervised methods to learn sampling distributions for particle filters, improving their accuracy and computational efficiency in estimating nonlinear dynamical systems.
Contribution
It proposes novel unsupervised learning techniques for sampling distributions, including three parametric and one nonparametric, tailored for particle filters.
Findings
Learned distributions outperform designed ones in experiments.
Parametric methods exploit data structure for better sampling.
Nonparametric method offers flexible transformation of uniform variables.
Abstract
Accurate estimation of the states of a nonlinear dynamical system is crucial for their design, synthesis, and analysis. Particle filters are estimators constructed by simulating trajectories from a sampling distribution and averaging them based on their importance weight. For particle filters to be computationally tractable, it must be feasible to simulate the trajectories by drawing from the sampling distribution. Simultaneously, these trajectories need to reflect the reality of the nonlinear dynamical system so that the resulting estimators are accurate. Thus, the crux of particle filters lies in designing sampling distributions that are both easy to sample from and lead to accurate estimators. In this work, we propose to learn the sampling distributions. We put forward four methods for learning sampling distributions from observed measurements. Three of the methods are parametric…
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.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Time Series Analysis and Forecasting
