Interacting Multiple Try Algorithms with Different Proposal Distributions

Abstract

We propose a new class of interacting Markov chain Monte Carlo (MCMC) algorithms designed for increasing the efficiency of a modified multiple-try Metropolis (MTM) algorithm. The extension with respect to the existing MCMC literature is twofold. The sampler proposed extends the basic MTM algorithm by allowing different proposal distributions in the multiple-try generation step. We exploit the structure of the MTM algorithm with different proposal distributions to naturally introduce an interacting MTM mechanism (IMTM) that expands the class of population Monte Carlo methods. We show the validity of the algorithm and discuss the choice of the selection weights and of the different proposals. We provide numerical studies which show that the new algorithm can perform better than the basic MTM algorithm and that the interaction mechanism allows the IMTM to efficiently explore the state space.

Cited by in corpus (11)

• A Survey of Monte Carlo Methods for Parameter Estimation
• A Review of Multiple Try MCMC algorithms for Signal Processing
• Orthogonal parallel MCMC methods for sampling and optimization
• Group Importance Sampling for Particle Filtering and MCMC
• On the flexibility of the design of Multiple Try Metropolis schemes
• A multi-point Metropolis scheme with generic weight functions
• Metropolis Sampling
• Issues in the Multiple Try Metropolis mixing
• Parallel Metropolis chains with cooperative adaptation
• A Parallel Evolutionary Multiple-Try Metropolis Markov Chain Monte Carlo Algorithm for Sampling Spatial Partitions
• Fast Bayesian analysis of individual binaries in pulsar timing array data