A vanilla Rao--Blackwellization of Metropolis--Hastings algorithms
arXiv:0904.2144 · doi:10.1214/10-AOS838
Abstract
Casella and Robert [Biometrika 83 (1996) 81--94] presented a general Rao--Blackwellization principle for accept-reject and Metropolis--Hastings schemes that leads to significant decreases in the variance of the resulting estimators, but at a high cost in computation and storage. Adopting a completely different perspective, we introduce instead a universal scheme that guarantees variance reductions in all Metropolis--Hastings-based estimators while keeping the computation cost under control. We establish a central limit theorem for the improved estimators and illustrate their performances on toy examples and on a probit model estimation.
arXiv commentPublished in at http://dx.doi.org/10.1214/10-AOS838 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Cited by in corpus (6)
- On Russian Roulette Estimates for Bayesian Inference with Doubly-Intractable Likelihoods
- Importance sampling type estimators based on approximate marginal MCMC
- Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance
- Computing Bayes: From Then 'Til Now'
- On a Metropolis-Hastings importance sampling estimator
- The Importance Markov Chain