The importance Markov chain

  • Charly Andral
  • , Randal Douc
  • , Hugo Marival
  • , Christian P. Robert

Research output: Contribution to journalArticlepeer-review

Abstract

The Importance Markov chain is a novel algorithm bridging the gap between rejection sampling and importance sampling, moving from one to the other through a tuning parameter. Based on a modified sample of an instrumental Markov chain targeting an instrumental distribution (typically via a MCMC kernel), the Importance Markov chain produces an extended Markov chain where the marginal distribution of the first component converges to the target distribution. For example, when targeting a multimodal distribution, the instrumental distribution can be chosen as a tempered version of the target which allows the algorithm to explore its modes more efficiently. We obtain a Law of Large Numbers and a Central Limit Theorem as well as geometric ergodicity for this extended kernel under mild assumptions on the instrumental kernel. Computationally, the algorithm is easy to implement and preexisting librairies can be used to sample from the instrumental distribution.

Original languageEnglish
Article number104316
JournalStochastic Processes and their Applications
Volume171
DOIs
Publication statusPublished - 1 May 2024

Keywords

  • Ergodicity
  • Importance sampling
  • Markov chain Monte Carlo
  • Monte Carlo methods
  • Regeneration

Fingerprint

Dive into the research topics of 'The importance Markov chain'. Together they form a unique fingerprint.

Cite this