Translator Disclaimer
February 2019 Sequential Monte Carlo as approximate sampling: bounds, adaptive resampling via $\infty$-ESS, and an application to particle Gibbs
Jonathan H. Huggins, Daniel M. Roy
Bernoulli 25(1): 584-622 (February 2019). DOI: 10.3150/17-BEJ999


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 $\infty$-ESS, we establish the efficiency of the resulting SMC sampling algorithm, providing an adaptive resampling extension of the work of Andrieu, Lee, and Vihola (2018). 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.


Download Citation

Jonathan H. Huggins. Daniel M. Roy. "Sequential Monte Carlo as approximate sampling: bounds, adaptive resampling via $\infty$-ESS, and an application to particle Gibbs." Bernoulli 25 (1) 584 - 622, February 2019.


Received: 1 March 2015; Revised: 1 April 2017; Published: February 2019
First available in Project Euclid: 12 December 2018

zbMATH: 07007218
MathSciNet: MR3892330
Digital Object Identifier: 10.3150/17-BEJ999

Rights: Copyright © 2019 Bernoulli Society for Mathematical Statistics and Probability


This article is only available to subscribers.
It is not available for individual sale.

Vol.25 • No. 1 • February 2019
Back to Top