Interacting multiple try algorithms with different proposal distributions Articles uri icon

authors

  • CASARIN, R.
  • CRAIU, R.
  • LEISEN, FABRIZIO

publication date

  • March 2013

start page

  • 185

end page

  • 200

issue

  • 2

volume

  • 23

international standard serial number (ISSN)

  • 0960-3174

electronic international standard serial number (EISSN)

  • 1573-1375

abstract

  • We introduce a new class of interacting Markov chain Monte Carlo (MCMC) algorithms which is designed to increase the efficiency of a modified multiple-try Metropolis (MTM) sampler. The extension with respect to the existing MCMC literature is twofold. First, the sampler proposed extends the basic MTM algorithm by allowing for different proposal distributions in the multiple-try generation step. Second, we exploit the different proposal distributions to naturally introduce an interacting MTM mechanism (IMTM) that expands the class of population Monte Carlo methods and builds connections with the rapidly expanding world of adaptive MCMC. We show the validity of the algorithm and discuss the choice of the selection weights and of the different proposals. The numerical studies show that the interaction mechanism allows the IMTM to efficiently explore the state space leading to higher efficiency than other competing algorithms.

keywords

  • interacting monte carlo; markov chain monte carlo; multiple-try metropolis; population monte carlo; ; simulated annealing