Resampling from the past to improve on MCMC algorithms
Yves F. Atchade
Abstract
We introduce the idea that resampling from past observations in a Markov Chain Monte Carlo sampler can fasten convergence. We prove that proper resampling from the past does not disturb the limit distribution of the algorithm. We illustrate the method with two examples. The first on a Bayesian analysis of stochastic volatility models and the other on Bayesian phylogeny reconstruction.
Create a lesson
Related papers
Conformal Prediction Through the Lens of Hypothesis Testing: Universality, Impossibility, and Optimality
Ryan J. Tibshirani, Rina Foygel Barber, Aaditya Ramdas
Connecting Riemannian Geometry and Statistical Inference for Correlation Matrices
Argyn Kuketayev
How far can symmetry help? Phase transitions and symmetry selection in sparse functional data analysis
Jocelyn Nembe
Posterior consistency for subdiffusion inverse problems
Haoyu Lu, Shaokang Zu, Junxiong Jia
Dimension comparison for Student's statistic under symmetric unimodality
Jacopo Lenzi
Statistical Properties of Nonparametric MLE under Laplace Noise
Yifei Xiong, Nianqiao Phyllis Ju, Vinayak Rao