Adaptive Component-wise Multiple-Try Metropolis Sampling
Preprint
Abstract
One of the most widely used samplers in practice is the component-wise Metropolis-Hastings (CMH) sampler that updates in turn the components of a vector valued Markov chain using accept-reject moves generated from a proposal distribution. When the target distribution of a Markov chain is irregularly shaped, a `good' proposal distribution for one part of the state space might be a `poor' one for another part of the state space. We consider a component-wise multiple-try Metropolis (CMTM) algorithm that can automatically choose from a set of candidate moves sampled from different distributions. The computational efficiency is increased using an adaptation rule for the CMTM algorithm that dynamically builds a better set of proposal distributions as the Markov chain runs. The ergodicity of the adaptive chain is demonstrated theoretically. The performance is studied via simulations and real data examples.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Likelihood inflating sampling algorithmCanadian Journal of Statistics, 2017
- Ergodicity of Combocontinuous Adaptive MCMC AlgorithmsMethodology and Computing in Applied Probability, 2017
- Interacting multiple try algorithms with different proposal distributionsStatistics and Computing, 2011
- A tutorial on adaptive MCMCStatistics and Computing, 2008
- Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified samplingStatistics and Computing, 2007
- DRAM: Efficient adaptive MCMCStatistics and Computing, 2006
- On the efficiency of adaptive MCMC algorithms2006
- Componentwise adaptation for high dimensional MCMCComputational Statistics, 2005
- Adaptive proposal distribution for random walk Metropolis algorithmComputational Statistics, 1999
- Efficient Metropolis Jumping Rules1996