Adaptive Metropolis-Hastings Sampling using Reversible Dependent Mixture Proposals
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 12 May 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2.
2 papers.
- 2024Reinforcement Learning for Adaptive MCMCcited by 6
- 2024On Divergence Measures for Training GFlowNetscited by 6
- 2024On Divergence Measures for Training GFlowNets12 Oct 2024
- 2024Reinforcement Learning for Adaptive MCMC22 May 2024