Embarrassingly Parallel Inference for Gaussian Processes

Training Gaussian process-based models typically involves an $O(N^3)$ computational bottleneck due to inverting the covariance matrix. Popular methods for overcoming this matrix inversion problem cannot adequately model all types of latent functions, and are often not parallelizable. However, judicious choice of model structure can ameliorate this problem. A mixture-of-experts model that uses a mixture of $K$ Gaussian processes offers modeling flexibility and opportunities for scalable inference. Our embarrassingly parallel algorithm combines low-dimensional matrix inversions with importance sampling to yield a flexible, scalable mixture-of-experts model that offers comparable performance to Gaussian process regression at a much lower computational cost. [abs] [ pdf ][ bib ] &copy JMLR 2019. ( edit, beta )

Authors

• Michael Minyi Zhang
• Sinead A. Williamson

Keywords

No keywords are indexed for this paper.