Massively parallel approximate Gaussian process regression
Not on the map. Why?
Abstract (arXiv)
We explore how the big-three computing paradigms -- symmetric multi-processor (SMC), graphical processing units (GPUs), and cluster computing -- can together be brought to bare on large-data Gaussian processes (GP) regression problems via a careful implementation of a newly developed local approximation scheme. Our methodological contribution focuses primarily on GPU computation, as this requires the most care and also provides the largest performance boost. However, in our empirical work we study the relative merits of all three paradigms to determine how best to combine them. The paper concludes with two case studies. One is a real data fluid-dynamics computer experiment which benefits from the local nature of our approximation; the second is a synthetic data example designed to find the largest design for which (accurate) GP emulation can performed on a commensurate predictive set under an hour.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Oct 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2.
4 papers.
- 2023Active Learning of Piecewise Gaussian Process Surrogatescited by 5
- 2025Modular Jump Gaussian Processescited by 2
- 2024Implementation and Analysis of GPU Algorithms for Vecchia Approximationcited by 1
- 2025Deep Jump Gaussian Processes for Surrogate Modeling of High-Dimensional Piecewise Continuous Functionscited by 1
- 2025Deep Jump Gaussian Processes for Surrogate Modeling of High-Dimensional Piecewise Continuous Functions24 Oct 2025
- 2025Modular Jump Gaussian Processes21 May 2025
- 2024Implementation and Analysis of GPU Algorithms for Vecchia Approximation3 Jul 2024
- 2023Active Learning of Piecewise Gaussian Process Surrogates20 Jan 2023