Table of Contents
Fetching ...

Calibrated Computation-Aware Gaussian Processes

Disha Hegde, Mohamed Adil, Jon Cockayne

TL;DR

This work tackles the scalability of Gaussian process regression by employing computation-aware GPs (CAGPs) that incorporate uncertainty from reduced computation via probabilistic solvers. It identifies calibration issues with standard BayesCG-based CAGPs and proves that using a calibrated solver yields a calibrated CAGP posterior, introducing a Gauss-Seidel-based CAGP (CAGP-GS) within a PSIM framework. The paper develops the theoretical calibration guarantees, implements CAGP-GS, and demonstrates improved mean convergence and calibrated uncertainty on synthetic data, UCI benchmarks, and a large-scale ERA5 regression task. The findings suggest that calibrated, PSIM-driven CAGPs enable reliable, computation-efficient GP regression, especially when only a small number of iterations are feasible. This has practical impact for large-scale Bayesian regression where exact GP inference is prohibitive but calibrated uncertainty is essential.

Abstract

Gaussian processes are notorious for scaling cubically with the size of the training set, preventing application to very large regression problems. Computation-aware Gaussian processes (CAGPs) tackle this scaling issue by exploiting probabilistic linear solvers to reduce complexity, widening the posterior with additional computational uncertainty due to reduced computation. However, the most commonly used CAGP framework results in (sometimes dramatically) conservative uncertainty quantification, making the posterior unrealistic in practice. In this work, we prove that if the utilised probabilistic linear solver is calibrated, in a rigorous statistical sense, then so too is the induced CAGP. We thus propose a new CAGP framework, CAGP-GS, based on using Gauss-Seidel iterations for the underlying probabilistic linear solver. CAGP-GS performs favourably compared to existing approaches when the test set is low-dimensional and few iterations are performed. We test the calibratedness on a synthetic problem, and compare the performance to existing approaches on a large-scale global temperature regression problem.

Calibrated Computation-Aware Gaussian Processes

TL;DR

This work tackles the scalability of Gaussian process regression by employing computation-aware GPs (CAGPs) that incorporate uncertainty from reduced computation via probabilistic solvers. It identifies calibration issues with standard BayesCG-based CAGPs and proves that using a calibrated solver yields a calibrated CAGP posterior, introducing a Gauss-Seidel-based CAGP (CAGP-GS) within a PSIM framework. The paper develops the theoretical calibration guarantees, implements CAGP-GS, and demonstrates improved mean convergence and calibrated uncertainty on synthetic data, UCI benchmarks, and a large-scale ERA5 regression task. The findings suggest that calibrated, PSIM-driven CAGPs enable reliable, computation-efficient GP regression, especially when only a small number of iterations are feasible. This has practical impact for large-scale Bayesian regression where exact GP inference is prohibitive but calibrated uncertainty is essential.

Abstract

Gaussian processes are notorious for scaling cubically with the size of the training set, preventing application to very large regression problems. Computation-aware Gaussian processes (CAGPs) tackle this scaling issue by exploiting probabilistic linear solvers to reduce complexity, widening the posterior with additional computational uncertainty due to reduced computation. However, the most commonly used CAGP framework results in (sometimes dramatically) conservative uncertainty quantification, making the posterior unrealistic in practice. In this work, we prove that if the utilised probabilistic linear solver is calibrated, in a rigorous statistical sense, then so too is the induced CAGP. We thus propose a new CAGP framework, CAGP-GS, based on using Gauss-Seidel iterations for the underlying probabilistic linear solver. CAGP-GS performs favourably compared to existing approaches when the test set is low-dimensional and few iterations are performed. We test the calibratedness on a synthetic problem, and compare the performance to existing approaches on a large-scale global temperature regression problem.

Paper Structure

This paper contains 30 sections, 6 theorems, 47 equations, 13 figures, 3 algorithms.

Key Result

Proposition 2

It holds that $f \mid y$ from eq:gp_posterior is equal to the posterior $f \mid v$ from Bayesian inference under the observation model: where $\bar{\zeta} \sim \mathcal{N}(0, \sigma^2 G^{-2})$.

Figures (13)

  • Figure 1: RMSE for the synthetic problem in \ref{['sec:synthetic']}.
  • Figure 2: NLL for the synthetic problem in \ref{['sec:synthetic']}.
  • Figure 3: Simulation-based calibration results for the synthetic problem described in \ref{['sec:synthetic']} after $m = 5$ iterations.
  • Figure 4: RMSE and NLL for different datasets in \ref{['sec:benchmark']}
  • Figure 5: Sequences of posterior means for the large-scale regression from \ref{['sec:era5']}, as a function of $m$. The x and y axes represent longitudes and latitudes respectively, and the contours indicate the temperature in Kelvin.
  • ...and 8 more figures

Theorems & Definitions (13)

  • Definition 1: Cockayne2021PIMs
  • Proposition 2
  • Corollary 3
  • Theorem 4
  • Corollary 5
  • Proposition 6
  • Proposition 7
  • proof : Proof of \ref{['prop:reparam_obs_model']}
  • proof : Proof of \ref{['corr:cagp_req_prior']}
  • proof : Proof of \ref{['thm:itergp_calib']}
  • ...and 3 more