Patchwork Kriging for Large-scale Gaussian Process Regression
Not on the map. Why?
Abstract (arXiv)
This paper presents a new approach for Gaussian process (GP) regression for large datasets. The approach involves partitioning the regression input domain into multiple local regions with a different local GP model fitted in each region. Unlike existing local partitioned GP approaches, we introduce a technique for patching together the local GP models nearly seamlessly to ensure that the local GP models for two neighboring regions produce nearly the same response prediction and prediction error variance on the boundary between the two regions. This largely mitigates the well-known discontinuity problem that degrades the boundary accuracy of existing local partitioned GP methods. Our main innovation is to represent the continuity conditions as additional pseudo-observations that the differences between neighboring GP responses are identically zero at an appropriately chosen set of boundary input locations. To predict the response at any input location, we simply augment the actual response observations with the pseudo-observations and apply standard GP prediction methods to the augmented data. In contrast to heuristic continuity adjustments, this has an advantage of working within a formal GP framework, so that the GP-based predictive uncertainty quantification remains valid. Our approach also inherits a sparse block-like structure for the sample covariance matrix, which results in computationally efficient closed-form expressions for the predictive mean and variance. In addition, we provide a new spatial partitioning scheme based on a recursive space partitioning along local principal component directions, which makes the proposed approach applicable for regression domains having more than two dimensions. Using three spatial datasets and three higher dimensional datasets, we investigate the numerical performance of the approach and compare it to several state-of-the-art approaches.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 23 Jan 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 1; 2024: 0; 2025: 1; 2026: 1.
9 papers.
- 2021Data Fusion with Latent Map Gaussian Processescited by 16
- 2021Trust Your Robots! Predictive Uncertainty Estimation of Neural Networks with Sparse Gaussian Processescited by 12
- 2022Variational Nearest Neighbor Gaussian Processcited by 8
- 2022Relaxed Gaussian process interpolation: a goal-oriented approach to Bayesian optimizationcited by 2
- 2023A Global-Local Approximation Framework for Large-Scale Gaussian Process Modelingcited by 2
- 2021Gradient Boosted Binary Histogram Ensemble for Large-scale Regressioncited by 1
- 2022Entry Dependent Expert Selection in Distributed Gaussian Processes Using Multilabel Classificationcited by 0
- 2025A Partitioned Sparse Variational Gaussian Process for Fast, Distributed Spatial Modelingcited by 0
- 2026Hierarchical Bayesian Quadraturecited by 0
- 2026Hierarchical Bayesian Quadrature12 Jul 2026
- 2025A Partitioned Sparse Variational Gaussian Process for Fast, Distributed Spatial Modeling22 Jul 2025
- 2023A Global-Local Approximation Framework for Large-Scale Gaussian Process Modeling17 May 2023
- 2022Entry Dependent Expert Selection in Distributed Gaussian Processes Using Multilabel Classification17 Nov 2022
- 2022Relaxed Gaussian process interpolation: a goal-oriented approach to Bayesian optimization7 Jun 2022
- 2022Variational Nearest Neighbor Gaussian Process3 Feb 2022
- 2021Data Fusion with Latent Map Gaussian Processes4 Dec 2021
- 2021Trust Your Robots! Predictive Uncertainty Estimation of Neural Networks with Sparse Gaussian Processes20 Sep 2021
- 2021Gradient Boosted Binary Histogram Ensemble for Large-scale Regression3 Jun 2021