Sequentially Interacting Markov Chain Monte Carlo Methods

نویسندگان

  • Anthony Brockwell
  • Pierre Del Moral
  • Arnaud Doucet
چکیده

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 addressed using Sequential Monte Carlo (SMC) methods. The alternative Sequentially Interacting Markov Chain Monte Carlo (SIMCMC) scheme proposed here works by generating interacting non-Markovian sequences which behave asymptotically like independent Metropolis-Hastings (MH) Markov chains with the desired limiting distributions. Contrary to SMC methods, this scheme allows us to iteratively improve our estimates in an MCMC-like fashion. We establish convergence of the algorithm under realistic verifiable assumptions and demonstrate its performance on several examples arising in Bayesian time series analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interacting Particle Markov Chain Monte Carlo

We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler on an extended space. We present empirical results that show significant improvements in mixing rates relative to both noninteracting PMCMC samplers and a s...

متن کامل

Fluctuations of Interacting Markov Chain Monte Carlo Methods

We present a multivariate central limit theorem for a general class of interacting Markov chain Monte Carlo algorithms used to solve nonlinear measure-valued equations. These algorithms generate stochastic processes which belong to the class of nonlinear Markov chains interacting with their empirical occupation measures. We develop an original theoretical analysis based on resolvent operators a...

متن کامل

On Non-linear Markov Chain Monte Carlo via Self-interacting Approximations

Let P(E) be the space of probability measures on a measurable space (E, E). In this paper we introduce a class of non-linear Markov Chain Monte Carlo (MCMC) methods for simulating from a probability measure π ∈ P(E). Non-linear Markov kernels (e.g. Del Moral (2004); Del Moral & Doucet (2003)) K : P(E) × E → P(E) can be constructed to admit π as an invariant distribution and have superior mixing...

متن کامل

Monte Carlo methods for strongly interacting polymer systems

Markov chain Monte Carlo methods often su er from slow convergence problems when applied to strongly interacting polymer systems. One way to alleviate these problems is to run several Markov chains in parallel, with the di erent Markov chains being designed to sample at di erent temperatures, and with suitable swapping of con gurations between pairs of chains. This method was rst invented by Ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008