On Markov Chain Monte Carlo Acceleration
STANFORD UNIV CA DEPT OF STATISTICS
Pagination or Media Count:
Markov chain Monte Carlo MCMC methods are currently enjoying a surge of interest within the statistical community. The goal of this work is to formalize and support two distinct adaptive strategies which typically accelerate the convergence of a MCMC algorithm. One approach is through resampling the other incorporates adaptive switching of the transition kernel. Support is both by analytic arguments and simulation study. Application is envisioned in low dimensional but non-trivial problems. Two pathological illustrations are presented. Connections with reparametrization are discussed as well as possible difficulties with infinitely often adaptation.
- Statistics and Probability