mlsanityData to 14 Oct 2026

Practical Global and Local Bounds in Gaussian Process Regression via Chaining

arXiv 2511.09144 ↗First posted 12 Nov 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Gaussian process regression (GPR) is a popular nonparametric Bayesian method that provides predictive uncertainty estimates and is widely used in safety-critical applications. While prior research has introduced various uncertainty bounds, most existing approaches require access to specific input features, and rely on posterior mean and variance estimates or the tuning of hyperparameters. These limitations hinder robustness and fail to capture the model's global behavior in expectation. To address these limitations, we propose a chaining-based framework for estimating upper and lower bounds on the expected extreme values over unseen data, without requiring access to specific input features. We provide kernel-specific refinements for commonly used kernels such as RBF and Mat'ern, in which our bounds are tighter than generic constructions. We further improve numerical tightness by avoiding analytical relaxations. In addition to global estimation, we also develop a novel method for local uncertainty quantification at specified inputs. This approach leverages chaining geometry through partition diameters, adapting to local structures without relying on posterior variance scaling. Our experimental results validate the theoretical findings and demonstrate that our method outperforms existing approaches on both synthetic and real-world datasets.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 19 references that are in the map. First posted on arXiv 12 Nov 2025.

Builds on

4 of 19 references.

References · 4

  1. 2017On Kernelized Multi-armed Banditscited by 352
  2. 2019Distribution Calibration for Regressioncited by 89
  3. 2021Practical and Rigorous Uncertainty Bounds for Gaussian Process Regressioncited by 49
  4. 2023On the Sublinear Regret of GP-UCBcited by 26

Built on by

Not cited yet.