Sequential Monte Carlo as Approximate Sampling: bounds, adaptive resampling via -ESS, and an application to Particle Gibbs
arXiv:1503.00966 · doi:10.3150/17-BEJ999
Abstract
Sequential Monte Carlo (SMC) algorithms were originally designed for estimating intractable conditional expectations within state-space models, but are now routinely used to generate approximate samples in the context of general-purpose Bayesian inference. In particular, SMC algorithms are often used as subroutines within larger Monte Carlo schemes, and in this context, the demands placed on SMC are different: control of mean-squared error is insufficient---one needs to control the divergence from the target distribution directly. Towards this goal, we introduce the conditional adaptive resampling particle filter, building on the work of Gordon, Salmond, and Smith (1993), Andrieu, Doucet, and Holenstein (2010), and Whiteley, Lee, and Heine (2016). By controlling a novel notion of effective sample size, the -ESS, we establish the efficiency of the resulting SMC sampling algorithm, providing an adaptive resampling extension of the work of Andrieu, Lee, and Vihola (2013). We apply our results to arrive at new divergence bounds for SMC samplers with adaptive resampling as well as an adaptive resampling version of the Particle Gibbs algorithm with the same geometric-ergodicity guarantees as its nonadaptive counterpart.
arXiv comment34 pages
References in corpus (8)
- The pseudo-marginal approach for efficient Monte Carlo computations
- On adaptive resampling strategies for sequential Monte Carlo methods
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
- On particle Gibbs sampling
- On the role of interaction in sequential Monte Carlo algorithms
- Particle filters
- Uniform ergodicity of the Particle Gibbs sampler
- Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
Cited by in corpus (9)
- Effective Sample Size for Importance Sampling based on discrepancy measures
- Rethinking the Effective Sample Size
- Group Importance Sampling for Particle Filtering and MCMC
- Variational Sequential Monte Carlo
- On the Pitfalls of Nested Monte Carlo
- AIDE: An algorithm for measuring the accuracy of probabilistic inference algorithms
- When is Particle Filtering Efficient for Planning in Partially Observed Linear Dynamical Systems?
- Advances in Importance Sampling
- Generalized Posterior Calibration via Sequential Monte Carlo Sampler