Markov chain Monte Carlo algorithms with sequential proposals
From MaRDI portal
Publication:2209708
Abstract: We explore a general framework in Markov chain Monte Carlo (MCMC) sampling where sequential proposals are tried as a candidate for the next state of the Markov chain. This sequential-proposal framework can be applied to various existing MCMC methods, including Metropolis-Hastings algorithms using random proposals and methods that use deterministic proposals such as Hamiltonian Monte Carlo (HMC) or the bouncy particle sampler. Sequential-proposal MCMC methods construct the same Markov chains as those constructed by the delayed rejection method under certain circumstances. In the context of HMC, the sequential-proposal approach has been proposed as extra chance generalized hybrid Monte Carlo (XCGHMC). We develop 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). The numerical efficiency of these new methods compare favorably to the NUTS. We additionally show that the sequential-proposal bouncy particle sampler enables the constructed Markov chain to pass through regions of low target density and thus facilitates better mixing of the chain when the target density is multimodal.
Recommendations
- The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
- Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals
- Particle Markov Chain Monte Carlo Methods
- Sequential Monte Carlo samplers with independent Markov chain Monte Carlo proposals
- Designing simple and efficient Markov chain Monte Carlo proposal kernels
Cites work
- A note on Metropolis-Hastings kernels for general state spaces
- An adaptive Metropolis algorithm
- An improved acceptance procedure for the hybrid Monte Carlo algorithm
- Convergence of Slice Sampler Markov Chains
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Delayed rejection in reversible jump Metropolis-Hastings.
- Ensemble samplers with affine invariance
- Equation of state calculations by fast computing machines
- Equi-energy sampler with applications in statistical inference and statistical mechanics
- Extra chance generalized hybrid Monte Carlo
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels. II
- MCMC using Hamiltonian dynamics
- Monte Carlo sampling methods using Markov chains and their applications
- On adaptive Markov chain Monte Carlo algorithms
- On Metropolis-Hastings algorithms with delayed rejection
- On the efficiency of adaptive MCMC algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Optimal tuning of the hybrid Monte Carlo algorithm
- Optimum Monte-Carlo sampling using Markov chains
- Perfect slice samplers
- Simulating Hamiltonian Dynamics
- Slice sampling. (With discussions and rejoinder)
- The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
- The random walk Metropolis: linking theory and practice through a case study
- Weak convergence and optimal scaling of random walk Metropolis algorithms
Cited in
(9)- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
- Designing simple and efficient Markov chain Monte Carlo proposal kernels
- A Metropolis-class sampler for targets with non-convex support
- Collective proposal distributions for nonlinear MCMC samplers: mean-field theory and fast implementation
- scientific article; zbMATH DE number 7387626 (Why is no real title available?)
- A Sequential Markov Chain Monte Carlo Approach to Set-up Adjustment of a Process over a Set of Lots
- On the accept-reject mechanism for Metropolis-Hastings algorithms
- Sampling algorithms in statistical physics: a guide for statistics and machine learning
- Parallel MCMC algorithms: theoretical foundations, algorithm design, case studies
This page was built for publication: Markov chain Monte Carlo algorithms with sequential proposals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2209708)
