Resampling from the past to improve on MCMC algorithms
classification
🧮 math.ST
math.PRstat.TH
keywords
pastresamplingbayesianalgorithmalgorithmsanalysiscarlochain
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.