 Waste‐free sequential Monte CarloHai‐Dang Dau and Nicolas Chopin Journal of the Royal Statistical Society Series B, 2022, vol. 84, issue 1, 114-148 Abstract: A standard way to move particles in a sequential Monte Carlo (SMC) sampler is to apply several steps of a Markov chain Monte Carlo (MCMC) kernel. Unfortunately, it is not clear how many steps need to be performed for optimal performance. In addition, the output of the intermediate steps are discarded and thus wasted somehow. We propose a new, waste‐free SMC algorithm which uses the outputs of all these intermediate MCMC steps as particles. We establish that its output is consistent and asymptotically normal. We use the expression of the asymptotic variance to develop various insights on how to implement the algorithm in practice. We develop in particular a method to estimate, from a single run of the algorithm, the asymptotic variance of any particle estimate. We show empirically, through a range of numerical examples, that waste‐free SMC tends to outperform standard SMC samplers, and especially so in situations where the mixing of the considered MCMC kernels decreases across iterations (as in tempering or rare event problems). Date: 2022 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:bla:jorssb:v:84:y:2022:i:1:p:114-148 Ordering information: This journal article can be ordered from Access Statistics for this article Journal of the Royal Statistical Society Series B is currently edited by P. Fryzlewicz and I. Van Keilegom More articles in Journal of the Royal Statistical Society Series B from Royal Statistical Society Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.