A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms
From MaRDI portal
Publication:2429930
DOI10.1214/10-AOS838zbMath1209.62023arXiv0904.2144MaRDI QIDQ2429930
Randal Douc, Christian P. Robert Robert
Publication date: 5 April 2011
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.2144
probit model; conditioning; central limit theorem; variance reduction; Markov chain Monte Carlo (MCMC)
60J22: Computational methods in Markov chains
62G05: Nonparametric estimation
60F05: Central limit and other weak theorems
62F10: Point estimation
65C40: Numerical analysis or methods applied to Markov chains
62B10: Statistical aspects of information-theoretic topics
Related Items
Markov Chain Importance Sampling—A Highly Efficient Estimator for MCMC, Bayesian computation: a summary of the current state, and samples backwards and forwards, Optimization via rejection-free partial neighbor search, Variance reduction of estimators arising from Metropolis-Hastings algorithms, On parallelizable Markov chain Monte Carlo algorithms with waste-recycling, Which ergodic averages have finite asymptotic variance?, Efficient estimation of the link function parameter in a robust Bayesian binary regression model, On Russian roulette estimates for Bayesian inference with doubly-intractable likelihoods, Jump Markov chains and rejection-free Metropolis algorithms, On a Metropolis-Hastings importance sampling estimator, Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance, Sampling Constrained Probability Distributions Using Spherical Augmentation
Uses Software
Cites Work
- Unnamed Item
- Limit theorems for weighted samples with applications to sequential Monte Carlo methods
- Self-regenerative Markov chain Monte Carlo with adaptation
- On convergence of properly weighted samples to the target distribution
- Statistical Analysis of Financial Data in S-Plus
- Does Waste Recycling Really Improve the Multi-Proposal Metropolis–Hastings algorithm? an Analysis Based on Control Variates
- Rao-Blackwellisation of sampling schemes
- Beyond accept-reject sampling