Sequential Monte Carlo samplers

  title={Sequential Monte Carlo samplers},
  author={Pierre Del Moral and A. Doucet},
  journal={Journal of The Royal Statistical Society Series B-statistical Methodology},
  • P. Moral, A. Doucet
  • Published 2002
  • Mathematics, Physics
  • Journal of The Royal Statistical Society Series B-statistical Methodology
We propose a methodology to sample sequentially from a sequence of probability distributions that are defined on a common space, each distribution being known up to a normalizing constant. These probability distributions are approximated by a cloud of weighted random samples which are propagated over time by using sequential Monte Carlo methods. This methodology allows us to derive simple algorithms to make parallel Markov chain Monte Carlo algorithms interact to perform global optimization and… Expand

Tables from this paper

Sequentially interacting Markov chain Monte Carlo methods
We introduce a novel methodology for sampling from a sequence of probability distributions of increasing dimension and estimating their normalizing constants. These problems are usually addressedExpand
Sequential Markov Chain Monte Carlo
We propose a sequential Markov chain Monte Carlo (SMCMC) algorithm to sample from a sequence of probability distributions, corresponding to posterior distributions at different times in on-lineExpand
Sequential Monte Carlo with transformations
This paper uses sequential Monte Carlo samplers for performing Bayesian inference sequentially on a sequence of posteriors on spaces of different dimensions to yield an extremely flexible and general algorithm for Bayesian model comparison that is suitable for use in applications where the acceptance rate in reversible jump Markov chain Monte Carlo is low. Expand
Sequential Monte Carlo for Graphical Models
A new framework for how to use sequential Monte Carlo (SMC) algorithms for inference in probabilistic graphical models (PGM) is proposed and one of the key merits of the SMC sampler is that it provides an unbiased estimate of the partition function of the model. Expand
A sequential Monte Carlo approach to computing tail probabilities in stochastic models
Sequential Monte Carlo methods which involve sequential importance sampling and resampling are shown to provide a versatile approach to computing probabilities of rare events. By making use ofExpand
Convergence of Monte Carlo distribution estimates from rival samplers
This article addresses how to optimally divide sampling effort between the samplers of the different distributions, and proposes a new Monte Carlo divergence error criterion based on Jensen–Shannon divergence. Expand
Finite Sample Complexity of Sequential Monte Carlo Estimators
We present bounds for the finite sample error of sequential Monte Carlo samplers on static spaces. Our approach explicitly relates the performance of the algorithm to properties of the chosenExpand
A stability analysis by funtional inequalities for a nonlinear flow of probability measures describing the limit behavior of the methods as the number of particles tends to infinity is developed. Expand
Monte Carlo convergence of rival samplers
It is often necessary to make sampling-based statistical inference about many probability distributions in parallel. Given a finite computational resource, this article addresses how to optimallyExpand
Particle Markov chain Monte Carlo methods
Markov chain Monte Carlo and sequential Monte Carlo methods have emerged as the two main tools to sample from high dimensional probability distributions. Although asymptotic convergence of MarkovExpand


On sequential Monte Carlo sampling methods for Bayesian filtering
An overview of methods for sequential simulation from posterior distributions for discrete time dynamic models that are typically nonlinear and non-Gaussian, and how to incorporate local linearisation methods similar to those which have previously been employed in the deterministic filtering literature are shown. Expand
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some fixedExpand
Trans-dimensional Markov chain Monte Carlo
Summary In the context of sample-based computation of Bayesian posterior distributions in complex stochastic systems, this chapter discusses some of the uses for a Markov chain with a prescribedExpand
Annealing Markov chain Monte Carlo with applications to ancestral inference
Abstract Markov chain Monte Carlo (MCMC; the Metropolis-Hastings algorithm) has been used for many statistical problems, including Bayesian inference, likelihood inference, and tests of significance.Expand
Following a moving target—Monte Carlo inference for dynamic Bayesian models
Markov chain Monte Carlo (MCMC) sampling is a numerically intensive simulation technique which has greatly improved the practicality of Bayesian inference and prediction. However, MCMC sampling isExpand
Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference
The term sequential Monte Carlo methods or, equivalently, particle filters, refers to a general class of iterative algorithms that performs Monte Carlo approximations of a given sequence ofExpand
Sequential Monte Carlo methods for dynamic systems
Abstract We provide a general framework for using Monte Carlo methods in dynamic systems and discuss its wide applications. Under this framework, several currently available techniques are studiedExpand
Dynamically Weighted Importance Sampling in Monte Carlo Computation
This article describes a new Monte Carlo algorithm, dynamically weighted importance sampling (DWIS), for simulation and optimization. In DWIS, the state of the Markov chain is augmented to aExpand
Annealed importance sampling
  • R. Neal
  • Mathematics, Physics
  • Stat. Comput.
  • 2001
It is shown how one can use the Markov chain transitions for such an annealing sequence to define an importance sampler, which can be seen as a generalization of a recently-proposed variant of sequential importance sampling. Expand
Population Monte Carlo
Importance sampling methods can be iterated like MCMC algorithms, while being more robust against dependence and starting values. The population Monte Carlo principle consists of iterated generationsExpand