Statistics and Computing

, Volume 16, Issue 4, pp 339–354

DRAM: Efficient adaptive MCMC

  • Heikki Haario
  • Marko Laine
  • Antonietta Mira
  • Eero Saksman
Article

DOI: 10.1007/s11222-006-9438-0

Cite this article as:
Haario, H., Laine, M., Mira, A. et al. Stat Comput (2006) 16: 339. doi:10.1007/s11222-006-9438-0
  • 2.8k Views

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.

Keywords

Adaptive Markov chain Monte CarloAdaptive Metropolis-HastingsDelayed rejectionEfficiency ordering

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Heikki Haario
    • 1
  • Marko Laine
    • 1
  • Antonietta Mira
    • 2
  • Eero Saksman
    • 3
  1. 1.Lappeenranta University of TechnologyLappeenrantaFinland
  2. 2.University of InsubriaVareseItaly
  3. 3.University of JyväaskyläaJyväaskyläaFinland