DRAM: Efficient adaptive MCMC

  • Authors:
  • Heikki Haario;Marko Laine;Antonietta Mira;Eero Saksman

  • Affiliations:
  • Lappeenranta University of Technology, Lappeenranta, Finland;Lappeenranta University of Technology, Lappeenranta, Finland;University of Insubria, Varese, Italy;University of Jyväaskyläa, Jyväaskyläa, Finland

  • Venue:
  • Statistics and Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

We propose to combine two quite powerful ideas that have recently appeared in the Markov chain Monte Carlo literature: adaptive Metropolis samplers and delayed rejection. The ergodicity of the resulting non-Markovian sampler is proved, and the efficiency of the combination is demonstrated with various examples. We present situations where the combination outperforms the original methods: adaptation clearly enhances efficiency of the delayed rejection algorithm in cases where good proposal distributions are not available. Similarly, delayed rejection provides a systematic remedy when the adaptation process has a slow start.