Improving Population Monte Carlo: Alternative Weighting and Resampling Schemes

Abstract

Population Monte Carlo (PMC) sampling methods are powerful tools for approximating distributions of static unknowns given a set of observations. These methods are iterative in nature: at each step they generate samples from a proposal distribution and assign them weights according to the importance sampling principle. Critical issues in applying PMC methods are the choice of the generating functions for the samples and the avoidance of the sample degeneracy. In this paper, we propose three new schemes that considerably improve the performance of the original PMC formulation by allowing for better exploration of the space of unknowns and by selecting more adequately the surviving samples. A theoretical analysis is performed, proving the superiority of the novel schemes in terms of variance of the associated estimators and preservation of the sample diversity. Furthermore, we show that they outperform other state of the art algorithms (both in terms of mean square error and robustness w.r.t. initialization) through extensive numerical simulations.

Signal Processing, 2016

References in corpus (4)

• Adaptive Importance Sampling in General Mixture Classes
• On adaptive resampling strategies for sequential Monte Carlo methods
• Generalized Multiple Importance Sampling
• Efficient Multiple Importance Sampling Estimators

Cited by in corpus (24)

• Effective Sample Size for Importance Sampling based on discrepancy measures
• A Survey of Monte Carlo Methods for Parameter Estimation
• Generalized Multiple Importance Sampling
• Rethinking the Effective Sample Size
• Importance Gaussian Quadrature
• Implicitly Adaptive Importance Sampling
• Robust Covariance Adaptation in Adaptive Importance Sampling
• Independent Resampling Sequential Monte Carlo Algorithms
• Optimized Population Monte Carlo
• Hamiltonian Adaptive Importance Sampling
• MCMC-driven importance samplers
• Rare Events via Cross-Entropy Population Monte Carlo
• A Bayesian inference and model selection algorithm with an optimisation scheme to infer the model noise power
• The Megopolis Resampler: Memory Coalesced Resampling on GPUs
• Nearly Consistent Finite Particle Estimates in Streaming Importance Sampling
• Population Quasi-Monte Carlo
• Tree pyramidal adaptive importance sampling
• Deep Importance Sampling based on Regression for Model Inversion and Emulation
• Configurational entropy, transition rates, and optimal interactions for rapid folding in coarse-grained model proteins
• The Harmonic Exponential Filter for Nonparametric Estimation on Motion Groups
• Advances in Importance Sampling
• Revisiting the balance heuristic for estimating normalising constants
• Analysis of a nonlinear importance sampling scheme for Bayesian parameter estimation in state-space models
• An Adaptive-Importance-Sampling-Enhanced Bayesian Approach for Topology Estimation in an Unbalanced Power Distribution System