# The Multiple-Try Method and Local Optimization in Metropolis Sampling

@article{Liu2000TheMM, title={The Multiple-Try Method and Local Optimization in Metropolis Sampling}, author={J. Liu and F. Liang and W. Wong}, journal={Journal of the American Statistical Association}, year={2000}, volume={95}, pages={121 - 134} }

Abstract This article describes a new Metropolis-like transition rule, the multiple-try Metropolis, for Markov chain Monte Carlo (MCMC) simulations. By using this transition rule together with adaptive direction sampling, we propose a novel method for incorporating local optimization steps into a MCMC sampler in continuous state-space. Numerical studies show that the new method performs significantly better than the traditional Metropolis-Hastings (M-H) sampler. With minor tailoring in using… Expand

#### 344 Citations

ON MULTIPLE TRY SCHEMES AND THE PARTICLE METROPOLIS-HASTINGS ALGORITHM

- Computer Science
- 2014

In this note, similarities and differences among the MTM schemes and the PMH method are investigated. Expand

Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified sampling

- Mathematics, Computer Science
- Stat. Comput.
- 2007

This work proposes a modification of the Multiple-Try Metropolis algorithm which allows for the use of correlated proposals, particularly antithetic and stratified proposals, and explores theUse of quasi Monte Carlo (QMC) methods to generate highly stratified samples. Expand

Acceleration of the Multiple-Try Metropolis using Antithetic and Stratified Sampling

The Multiple-Try Metropolis is a recent extension of the Metropolis algorithm in which the next state of the chain is selected among a set of proposals. We propose a modification of the Multiple-Try… Expand

Interacting multiple try algorithms with different proposal distributions

- Computer Science, Mathematics
- Stat. Comput.
- 2013

A new class of interacting Markov chain Monte Carlo algorithms which is designed to increase the efficiency of a modified multiple-try Metropolis (MTM) sampler and the interaction mechanism allows the IMTM to efficiently explore the state space leading to higher efficiency than other competing algorithms. Expand

Metropolis Sampling

- Mathematics, Computer Science
- 2017

This document describes in details all the elements involved in the MH algorithm and the most relevant variants, providing a quick but exhaustive overview of the current Metropolis-based sampling’s world. Expand

Antithetic Acceleration of the Multiple-Try Metropolis

The Multiple-Try Metropolis is a recent extension of the Metropolis algorithm in which the next state of the chain is selected among a set of proposals. We propose a modification of the Multiple-Try… Expand

Adaptive Component-Wise Multiple-Try Metropolis Sampling

- Mathematics, Computer Science
- 2016

A component-wise multiple-try Metropolis (CMTM) algorithm that chooses from a set of candidate moves sampled from different distributions that dynamically builds a better set of proposal distributions as the Markov chain runs. Expand

Scaling analysis of multiple-try MCMC methods

- Mathematics
- 2012

Abstract Multiple-try methods are extensions of the Metropolis algorithm in which the next state of the Markov chain is selected among a pool of proposals. These techniques have witnessed a recent… Expand

Markov chain Monte Carlo algorithms with sequential proposals

- Computer Science, Mathematics
- Stat. Comput.
- 2020

Two novel methods in which the trajectories leading to proposals in HMC are automatically tuned to avoid doubling back, as in the No-U-Turn sampler (NUTS), compare favorably to the NUTS. Expand

On the empirical efficiency of local MCMC algorithms with pools of proposals

- Mathematics
- 2013

In an attempt to improve on the Metropolis algorithm, various MCMC methods involving pools of proposals, such as the multiple-try Metropolis and delayed rejection strategies, have been proposed.… Expand

#### References

SHOWING 1-10 OF 27 REFERENCES

Adaptive Markov Chain Monte Carlo through Regeneration

- Mathematics
- 1998

Abstract Markov chain Monte Carlo (MCMC) is used for evaluating expectations of functions of interest under a target distribution π. This is done by calculating averages over the sample path of a… Expand

Performance of the Gibbs, Hit-and-Run, and Metropolis Samplers

- Mathematics
- 1993

Abstract We consider the performance of three Monte Carlo Markov-chain samplers—the Gibbs sampler, which cycles through coordinate directions; the Hit-and-Run (HR and the Metropolis sampler, which… Expand

Facilitating the Gibbs Sampler: The Gibbs Stopper and the Griddy-Gibbs Sampler

- Mathematics
- 1992

Abstract The article briefly reviews the history, literature, and form of the Gibbs sampler. An importance sampling device is proposed for converting the output of the Gibbs sampler to a sample from… Expand

Monte Carlo Sampling Methods Using Markov Chains and Their Applications

- Mathematics
- 1970

SUMMARY A generalization of the sampling method introduced by Metropolis et al. (1953) is presented along with an exposition of the relevant theory, techniques of application and methods and… Expand

Inference from Iterative Simulation Using Multiple Sequences

- Mathematics
- 1992

The Gibbs sampler, the algorithm of Metropolis and similar iterative simulation methods are potentially very helpful for summarizing multivariate distributions. Used naively, however, iterative… Expand

Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms

- Mathematics
- 1996

We develop results on geometric ergodicity of Markov chains and apply these and other recent results in Markov chain theory to multidimensional Hastings and Metropolis algorithms. For those based on… Expand

Predictive updating methods with application to Bayesian classification

- Mathematics
- 1996

We propose algorithms based on random draws from predictive distributions of unknown quantities (missing values, for instance). This procedure can either be iterative, which is a special variation of… Expand

A cavity-biased (T, V, μ) Monte Carlo method for the computer simulation of fluids

- Chemistry
- 1980

A modified sampling technique is proposed for use in Monte Carlo calculations in the grand canonical ensemble. The new method, called the cavity-biased (T, V, μ) Monte Carlo procedure, attempts… Expand

Estimation of Finite Mixture Distributions Through Bayesian Sampling

- Mathematics
- 1994

SUMMARY A formal Bayesian analysis of a mixture model usually leads to intractable calculations, since the posterior distribution takes into account all the partitions of the sample. We present… Expand

Multigrid Monte Carlo method. Conceptual foundations.

- Physics, Medicine
- Physical review. D, Particles and fields
- 1989

A stochastic generalization of the multigrid method, called multigrids Monte Carlo (MGMC), that reduces critical slowing down in Monte Carlo computations of lattice field theories, applicable to nonlinear {sigma} models, and to lattice gauge theories with or without bosonic matter fields. Expand