Accelerating MCMC via Parallel Predictive Prefetching

Parallel predictive prefetching is a new framework for accelerating a large class of widelyused Markov chain Monte Carlo (MCMC) algorithms. It speculatively evaluates many potential steps of an MCMC chain in parallel while exploiting fast, iterative approximations to the target density. This can accelerate sampling from target distributions in Bayesian inference problems. Our approach takes advantage of whatever parallel resources are available, but produces results exactly equivalent to standard serial execution. In the initial burn-in phase of chain evaluation, we achieve speedup close to linear in the number of available cores.

Authors

• Elaine Angelino
• Eddie Kohler
• Amos Waterland
• Margo I. Seltzer
• Ryan P. Adams

Keywords

No keywords are indexed for this paper.