A Partitioned Sparse Variational Gaussian Process for Fast, Distributed Spatial Modeling
Michael Grosskopf, Kellin Rumsey, Ayan Biswas, Earl Lawrence

TL;DR
This paper introduces a scalable, distributed Gaussian process modeling approach that improves spatial prediction smoothness by allowing limited communication between local models, suitable for exascale supercomputing environments.
Contribution
It extends sparse variational Gaussian processes by enabling inter-partition communication, enhancing model smoothness without sacrificing scalability.
Findings
Improved spatial prediction smoothness with minimal overhead.
Demonstrated effectiveness on the Energy Exascale Earth System Model.
Maintains high scalability and efficiency in distributed settings.
Abstract
The next generation of Department of Energy supercomputers will be capable of exascale computation. For these machines, far more computation will be possible than that which can be saved to disk. As a result, users will be unable to rely on post-hoc access to data for uncertainty quantification and other statistical analyses and there will be an urgent need for sophisticated machine learning algorithms which can be trained in situ. Algorithms deployed in this setting must be highly scalable, memory efficient and capable of handling data which is distributed across nodes as spatially contiguous partitions. One suitable approach involves fitting a sparse variational Gaussian process (SVGP) model independently and in parallel to each spatial partition. The resulting model is scalable, efficient and generally accurate, but produces the undesirable effect of constructing discontinuous…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms
