mlsanityData to 7 Oct 2026

Embarrassingly Parallel Inference for Gaussian Processes

arXiv 1702.08420 ↗First posted 27 Feb 2017stat.MLcited by 6

On the map: Mixture-of-experts → MoE theory and gating functions

Abstract (arXiv)

Training Gaussian process-based models typically involves an O(N3) 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.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. First posted on arXiv 27 Feb 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 0; 2025: 1.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2019Enriched Mixtures of Gaussian Process Experts
  2. 2018Learning Deep Mixtures of Gaussian Process Experts Using Sum-Product Networks
  3. 2020Efficiently Sampling Functions from Gaussian Process Posteriors
  4. 2023Gaussian Process-Gated Hierarchical Mixtures of Experts
  5. 2019Convergence Rates for Gaussian Mixtures of Experts
  6. 2020Fast Deep Mixtures of Gaussian Process Experts
  7. 2020A similarity-based Bayesian mixture-of-experts model
  8. 2025Dendrograms of Mixing Measures for Softmax-Gated Gaussian Mixture of Experts: Consistency Without Model Sweeps