[edit]
Accelerating MCMC via Parallel Predictive Prefetching
Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence, PMLR R12:795-804, 2014.
Abstract
Parallel predictive prefetching is a new frame- work for accelerating a large class of widely- used Markov chain Monte Carlo (MCMC) algo- rithms. It speculatively evaluates many potential steps of an MCMC chain in parallel while ex- ploiting fast, iterative approximations to the tar- get density. This can accelerate sampling from target distributions in Bayesian inference prob- lems. Our approach takes advantage of whatever parallel resources are available, but produces re- sults exactly equivalent to standard serial execu- tion. In the initial burn-in phase of chain evalu- ation, we achieve speedup close to linear in the number of available cores.