Independent Doubly Adaptive Rejection Metropolis Sampling Within Gibbs Sampling
From MaRDI portal
Abstract: Markov Chain Monte Carlo (MCMC) methods, such as the Metropolis-Hastings (MH) algorithm, are widely used for Bayesian inference. One of the most important issues for any MCMC method is the convergence of the Markov chain, which depends crucially on a suitable choice of the proposal density. Adaptive Rejection Metropolis Sampling (ARMS) is a well-known MH scheme that generates samples from one-dimensional target densities making use of adaptive piecewise proposals constructed using support points taken from rejected samples. In this work we pinpoint a crucial drawback in the adaptive procedure in ARMS: support points might never be added inside regions where the proposal is below the target. When this happens in many regions it leads to a poor performance of ARMS, with the proposal never converging to the target. In order to overcome this limitation we propose two improved adaptive schemes for constructing the proposal. The first one is a direct modification of the ARMS procedure that incorporates support points inside regions where the proposal is below the target, while satisfying the diminishing adaptation property, one of the required conditions to assure the convergence of the Markov chain. The second one is an adaptive independent MH algorithm with the ability to learn from all previous samples except for the current state of the chain, thus also guaranteeing the convergence to the invariant density. These two new schemes improve the adaptive strategy of ARMS, thus simplifying the complexity in the construction of the proposals. Numerical results show that the new techniques provide better performance w.r.t. the standard ARMS.
Cited in
(19)- Moments and random number generation for the truncated elliptical family of distributions
- Reliability estimation of stress-strength model using finite mixture distributions under progressively interval censoring
- Pricing options under simultaneous stochastic volatility and jumps: a simple closed-form formula without numerical/computational methods
- Cauchy Markov random field priors for Bayesian inversion
- A new adaptive approach of the Metropolis-Hastings algorithm applied to structural damage identification using time domain data
- On the flexibility of the design of multiple try Metropolis schemes
- Iterative construction of Gaussian process surrogate models for Bayesian inference
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Statistical inference of reliability of generalized Rayleigh distribution under progressively type-II censoring
- Direct sampling with a step function
- Sampling to maintain approximate probability distribution under chi-square test
- Adaptive Incremental Mixture Markov Chain Monte Carlo
- Sampling hyperparameters in hierarchical models: Improving on Gibbs for high-dimensional latent fields and large datasets
- Adaptive rejection sampling with fixed number of nodes
- Marginal Likelihood Computation for Model Selection and Hypothesis Testing: An Extensive Review
- scientific article; zbMATH DE number 7806555 (Why is no real title available?)
- Automated generation of initial points for adaptive rejection sampling of log-concave distributions
- Sampling by divergence minimization
- Rejection sampling with vertical weighted strips
This page was built for publication: Independent Doubly Adaptive Rejection Metropolis Sampling Within Gibbs Sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580626)
