Abstract
Sequential Monte Carlo (SMC) samplers [Del Moral, P., Doucet, A., Jasra, A., 2006. Sequential Monte Carlo samplers. J. Roy. Statist. Soc. B 68, 411–436] are designed to simulate from a sequence of probability measures on a common measurable space (E,E). One way to measure the accuracy of the resulting Monte Carlo estimates is the asymptotic variance in the central limit theorem (CLT). We investigate the conditions, for algorithms used in practice, which are sufficient to ensure that the resulting expression is upper bounded, of which, the typical conditions (e.g. [Chopin, N., 2004. Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference. Ann. Statist. 32, 2385–2411]) are quite restrictive. We use the Foster–Lyapunov condition and contractions in the f-norm of the Markov kernels [Douc, R., Moulines, E., Rosenthal, J.S., 2004. Quantitative bounds on convergence of time-inhomogeneous Markov chains. Ann. Appl. Probab. 14, 1643–1665] to establish quantitative bounds on the asymptotic variance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
