An adaptive sequential monte carlo sampler

41Citations
Citations of this article
94Readers
Mendeley users who have this article in their library.

Abstract

Sequential Monte Carlo (SMC) methods are not only a popular tool in the analysis of state-space models, but offer an alternative to Markov chain Monte Carlo (MCMC) in situations where Bayesian inference must proceed via simulation. This paper introduces a new SMC method that uses adaptive MCMC kernels for particle dynamics. The proposed algorithm features an online stochastic optimization procedure to select the best MCMC kernel and simultaneously learn optimal tuning parameters. Theoretical results are presented that justify the approach and give guidance on how it should be implemented. Empirical results, based on analysing data from mixture models, show that the new adaptive SMC algorithm (ASMC) can both choose the best MCMC kernel, and learn an appropriate scaling for it. ASMC with a choice between kernels outperformed the adaptive MCMC algorithm of Haario et al. (1998) in 5 out of the 6 cases considered. © 2013 International Society for Bayesian Analysis.

Cite

CITATION STYLE

APA

Fearnhead, P., & Taylor, B. M. (2013). An adaptive sequential monte carlo sampler. Bayesian Analysis, 8(2), 411–438. https://doi.org/10.1214/13-BA814

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free