Error Bounds and Normalizing Constants for Sequential Monte Carlo in High Dimensions

Abstract

In a recent paper Beskos et al (2011), the Sequential Monte Carlo (SMC) sampler introduced in Del Moral et al (2006), Neal (2001) has been shown to be asymptotically stable in the dimension of the state space d at a cost that is only polynomial in d, when N the number of Monte Carlo samples, is fixed. More precisely, it has been established that the effective sample size (ESS) of the ensuing (approximate) sample and the Monte Carlo error of fixed dimensional marginals will converge as $d$ grows, with a computational cost of $\mathcal{O}(N{d}^2)$. In the present work, further results on SMC methods in high dimensions are provided as $d\to \infty$ and with $N$ fixed. We deduce an explicit bound on the Monte-Carlo error for estimates derived using the SMC sampler and the exact asymptotic relative ${\mathbb{L}}_2$-error of the estimate of the normalizing constant. We also establish marginal propagation of chaos properties of the algorithm. The accuracy in high-dimensions of some approximate SMC-based filtering schemes is also discussed.

References in corpus (6)

• Curse-of-dimensionality revisited: Collapse of the particle filter in very large scale systems
• On adaptive resampling strategies for sequential Monte Carlo methods
• Sharp failure rates for the bootstrap particle filter in high dimensions
• Uniform Time Average Consistency of Monte Carlo Particle Filters
• Linear Variance Bounds for Particle Approximations of Time-Homogeneous Feynman-Kac Formulae
• Stability of Filters for the Navier-Stokes Equation

Cited by in corpus (3)

• Can local particle filters beat the curse of dimensionality?
• Static Parameter Estimation for ABC Approximations of Hidden Markov Models
• Generalised Particle Filters with Gaussian Mixtures