Scaling analysis of multiple-try MCMC methods
The authors consider multiple-try Markov chain Monte Carlo (MCMC) algorithms. These are distinguished from standard MCMC algorithms in that the next state in the chain is chosen from a pool of proposals. In this study multiple proposals with a dependence structure are considered, extending work on independently distributed multiple proposals. In particular, the authors focus on an extreme dependence structure such that all proposals are generated from one random vector, i.e., each proposal value in the pool can be used to calculate the remaining values in the pool. The considered efficiency measure for the algorithms is the speed the algorithms converge weakly to a diffusion process (asymptotic scaling), which, as is argued in the paper, is appropriate for high-dimensional target distributions. The authors prove convergence results of this type for multiple-try MCMC algorithms with dependencies in the proposals. The authors use scaling analysis to investigate the speed of the algorithms with respect to the number of proposal and the dependence structure of the proposals. A numerical example for a multivariate normal distribution is presented illustrating the theoretical findings. The authors conclude that introducing multiple proposals results in an increase in speed of the algorithm, which is further increased choosing dependent proposals over independent proposal. Hence, the algorithm might be practically more efficient for certain implementations, however, the study does not present a definitive answer.
- Convergence rate of multiple-try Metropolis independent sampler
- On the empirical efficiency of local MCMC algorithms with pools of proposals
- Issues in the multiple try Metropolis mixing
- On the flexibility of the design of multiple try Metropolis schemes
- Scaling analysis of delayed rejection MCMC methods
- A guide to Monte Carlo simulations in statistical physics.
- Advanced Markov chain Monte Carlo methods. Learning from past samples.
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- Markov-chain monte carlo: Some practical implications of theoretical results
- Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
- Optimal scaling for various Metropolis-Hastings algorithms.
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- Designing simple and efficient Markov chain Monte Carlo proposal kernels
- A Dirichlet form approach to MCMC optimal scaling
- Weak convergence and optimal tuning of the reversible jump algorithm
- Efficiency of delayed-acceptance random walk metropolis algorithms
- Generating MCMC proposals by randomly rotating the regular simplex
- Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics
- An adaptive multiple-try Metropolis algorithm
- Parallelizing MCMC sampling via space partitioning
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- On the flexibility of the design of multiple try Metropolis schemes
- Hierarchical models and tuning of random walk Metropolis algorithms
- A multiple-try Metropolis-Hastings algorithm with tailored proposals
- Optimal scaling for the transient phase of the random walk Metropolis algorithm: the mean-field limit
- Issues in the multiple try Metropolis mixing
- Scaling analysis of delayed rejection MCMC methods
- On the empirical efficiency of local MCMC algorithms with pools of proposals
- Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Conditional sequential Monte Carlo in high dimensions
- Optimal scaling of MCMC beyond Metropolis
- Convergence rate of multiple-try Metropolis independent sampler
- Computing Bayes: from then `til now
- Accelerating MCMC algorithms
- Analysis of Multiple-try Metropolis via Poincaré inequalities
- On the fundamental limitations of multi-proposal Markov chain Monte Carlo algorithms
- Interacting multiple try algorithms with different proposal distributions
This page was built for publication: Scaling analysis of multiple-try MCMC methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765876)
