Adaptive Markov chain Monte Carlo for auxiliary variable method and its application to parallel tempering
From MaRDI portal
(Redirected from Publication:2510806)
Abstract: Auxiliary variable methods such as the Parallel Tempering and the cluster Monte Carlo methods generate samples that follow a target distribution by using proposal and auxiliary distributions. In sampling from complex distributions, these algorithms are highly more efficient than the standard Markov chain Monte Carlo methods. However, their performance strongly depends on their parameters and determining the parameters is critical. In this paper, we proposed an algorithm for adapting the parameters during drawing samples and proved the convergence theorem of the adaptive algorithm. We applied our algorithm to the Parallel Tempering. That is, we developed adaptive Parallel Tempering that tunes the parameters on the fly. We confirmed the effectiveness of our algorithm through the validation of the adaptive Parallel Tempering, comparing samples from the target distribution by the adaptive Parallel Tempering and samples by conventional algorithms.
Recommendations
- Learn from thy neighbor: parallel-chain and regional adaptive MCMC
- A framework for adaptive MCMC targeting multimodal distributions
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- On adaptive Metropolis-Hastings methods
- Accelerating parallel tempering: quantile tempering algorithm (QuanTA)
Cites work
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- A computational framework for empirical Bayes inference
- Adaptive Markov Chain Monte Carlo through Regeneration
- An adaptive Metropolis algorithm
- Asymptotic behavior of exchange ratio in exchange Monte Carlo method
- Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Monte Carlo sampling methods using Markov chains and their applications
- Monte Carlo strategies in scientific computing
- On Bayesian model and variable selection using MCMC
- On the containment condition for adaptive Markov chain Monte Carlo algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
Cited in
(7)- Adaptive tempered reversible jump algorithm for Bayesian curve fitting
- Non-Reversible Parallel Tempering: A Scalable Highly Parallel MCMC Scheme
- An efficient sampling algorithm with adaptations for Bayesian variable selection
- Accelerating parallel tempering: quantile tempering algorithm (QuanTA)
- Weighted particle tempering
- A framework for adaptive MCMC targeting multimodal distributions
- On the flexibility of Metropolis-Hastings acceptance probabilities in auxiliary variable proposal generation
This page was built for publication: Adaptive Markov chain Monte Carlo for auxiliary variable method and its application to parallel tempering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2510806)