Compressed Monte Carlo with application in particle filtering
arXiv:2107.08459 · doi:10.1016/j.ins.2020.10.022
Abstract
Bayesian models have become very popular over the last years in several fields such as signal processing, statistics, and machine learning. Bayesian inference requires the approximation of complicated integrals involving posterior distributions. For this purpose, Monte Carlo (MC) methods, such as Markov Chain Monte Carlo and importance sampling algorithms, are often employed. In this work, we introduce the theory and practice of a Compressed MC (C-MC) scheme to compress the statistical information contained in a set of random samples. In its basic version, C-MC is strictly related to the stratification technique, a well-known method used for variance reduction purposes. Deterministic C-MC schemes are also presented, which provide very good performance. The compression problem is strictly related to the moment matching approach applied in different filtering techniques, usually called as Gaussian quadrature rules or sigma-point methods. C-MC can be employed in a distributed Bayesian inference framework when cheap and fast communications with a central processor are required. Furthermore, C-MC is useful within particle filtering and adaptive IS algorithms, as shown by three novel schemes introduced in this work. Six numerical results confirm the benefits of the introduced schemes, outperforming the corresponding benchmark methods. A related code is also provided.
References in corpus (13)
- Adaptive Importance Sampling in General Mixture Classes
- Cooperative Parallel Particle Filters for online model selection and applications to Urban Mobility
- Three discussions of the paper "sequential quasi-Monte Carlo sampling", by M. Gerber and N. Chopin
- Layered Adaptive Importance Sampling
- ExoFit: Orbital Parameters of Extra-solar Planets from Radial Velocities
- A multi-point Metropolis scheme with generic weight functions
- Sequential Kernel Herding: Frank-Wolfe Optimization for Particle Filtering
- Optimally-Weighted Herding is Bayesian Quadrature
- A proof of uniform convergence over time for a distributed particle filter
- Projected support points: a new method for high-dimensional data reduction
- Stein Points
- Support points
- Markov Chain Importance Sampling -- a highly efficient estimator for MCMC
Cited by in corpus (9)
- Marginal likelihood computation for model selection and hypothesis testing: an extensive review
- Rethinking the Effective Sample Size
- In Defense and Revival of Bayesian Filtering for Thermal Infrared Object Tracking
- Spectral information criterion for automatic elbow detection
- MCMC-driven importance samplers
- Online Particle Smoothing with Application to Map-matching
- Nearly Consistent Finite Particle Estimates in Streaming Importance Sampling
- Adaptive posterior distributions for uncertainty analysis of covariance matrices in Bayesian inversion problems for multioutput signals
- Compressed particle methods for expensive models with application in Astronomy and Remote Sensing