Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals
From MaRDI portal
Publication:2631371
Abstract: This article develops a general-purpose adaptive sampler that approximates the target density by a mixture of multivariate t densities. The adaptive sampler is based on reversible proposal distributions each of which has the mixture of multivariate t densities as its invariant density. The reversible proposals consist of a combination of independent and correlated steps that allow the sampler to traverse the parameter space efficiently as well as allowing the sampler to keep moving and locally exploring the parameter space. We employ a two-chain approach, in which a trial chain is used to adapt the proposal densities used in the main chain. Convergence of the main chain and a strong law of large numbers are proved under reasonable conditions, and without imposing a Diminishing Adaptation condition. The mixtures of multivariate t densities are fitted by an efficient Variational Approximation algorithm in which the number of components is determined automatically. The performance of the sampler is evaluated using simulated and real examples. Our autocorrelated framework is quite general and can handle mixtures other than multivariate t.
Recommendations
Cites work
- scientific article; zbMATH DE number 3753890 (Why is no real title available?)
- A New Approach to the Limit Theory of Recurrent Markov Chains
- A vine-copula based adaptive MCMC sampler for efficient inference of dynamical systems
- A weakly informative default prior distribution for logistic and other regression models
- Adaptive independent Metropolis-Hastings
- Adaptive proposal distribution for random walk Metropolis algorithm
- Adaptively scaling the Metropolis algorithm using expected squared jumped distance
- Advanced Markov chain Monte Carlo methods. Learning from past samples.
- An adaptive Metropolis algorithm
- Bayesian inference for a covariance matrix
- Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference
- Component-wise Markov chain Monte Carlo: uniform and geometric ergodicity under mixing and composition
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Estimation of a covariance matrix using the reference prior
- Extended constructions of stationary autoregressive processes
- Inference in hidden Markov models.
- Interacting multiple try algorithms with different proposal distributions
- Learn from thy neighbor: parallel-chain and regional adaptive MCMC
- Likelihood-based scoring rules for comparing density forecasts in tails
- Monte Carlo strategies in scientific computing
- On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
- On the ergodicity properties of some adaptive MCMC algorithms
- Probability and random processes.
- Sequential Monte Carlo Samplers
- Statistical Applications of the Multivariate Skew Normal Distribution
- Strictly Proper Scoring Rules, Prediction, and Estimation
- Tailored randomized block MCMC methods with application to DSGE models
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Variational approximation for heteroscedastic linear models and matching pursuit algorithms
- Variational approximations in Bayesian model selection for finite mixture distributions
Cited in
(15)- Plateau proposal distributions for adaptive component-wise multiple-try metropolis
- Adaptive tempered reversible jump algorithm for Bayesian curve fitting
- Partially collapsed Gibbs sampling and path-adaptive Metropolis-Hastings in high-energy astrophysics
- On an adaptive version of the Metropolis–Hastings algorithm with independent proposal distribution
- Bayesian inference using adaptive sampling
- Striated Metropolis-Hastings sampler for high-dimensional models
- A modified conditional Metropolis-Hastings sampler
- An adaptive multiple-try Metropolis algorithm
- On adaptive Metropolis-Hastings methods
- Learn from thy neighbor: parallel-chain and regional adaptive MCMC
- Bayesian adaptively updated Hamiltonian Monte Carlo with an application to high-dimensional BEKK GARCH models
- scientific article; zbMATH DE number 7008320 (Why is no real title available?)
- Markov chain Monte Carlo algorithms with sequential proposals
- Componentwise adaptation for high dimensional MCMC
- Adaptive Component-Wise Multiple-Try Metropolis Sampling
This page was built for publication: Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631371)
