Skip to content
Preprint

Rate-Preserving Shrinking-Support Gaussian Process Prediction

Sep 2026 · 0 citations
Mathematics

TL;DR

This work proposes a scale-adjusted compactly supported working correlation for Gaussian process prediction, using the generalized Wendland family with a support radius $\phi_n$ that is allowed to decrease with the sample size $n$.

Abstract

Gaussian process prediction is a central tool in spatial statistics, but standard implementations require dense matrix operations that become prohibitive for large datasets. We propose a scale-adjusted compactly supported working correlation for Gaussian process prediction, using the generalized Wendland family with a support radius $\phi_n$ that is allowed to decrease with the sample size $n$. Under fixed-domain asymptotics with quasi-uniform designs, a fixed support radius does not yield asymptotic sparsity, whereas a shrinking support radius can make the covariance matrix sparse. We show that $\phi_n$ and the regularization parameter can be jointly chosen so that the resulting predictor preserves the optimal integrated mean squared prediction error rate while reducing the number of nonzero covariance entries and the associated sparse matrix-vector multiplication cost. We also establish an analogous rate-preserving sparsification result for kernel ridge regression. Simulations and an ERA5 temperature application show that the proposed method achieves competitive prediction accuracy while retaining the computational efficiency provided by sparse linear algebra.

View source

Similar papers

Adaptive multi-resolution Gaussian processes: Scalable exact inference with naturally data-sparse covariance matrices

Theoretical analysis and numerical experiments demonstrate that the model achieves exact inference with $\mathcal{O}(n \log^2 n)$ training cost and $\mathcal{O}(\log^d n)$ prediction cost, establishing a principled framework for scalable and high-fidelity Gaussian process regression.

Yan-Chuang Cao, Jun Liu, Teng-Chao Yu et al. · 0 citations
#machine learning Preprint Oct 2026

SCORE: Spectral Correlation Estimation for Multivariate Gaussians

Neural network-based predictive modeling with high-dimensional structured Gaussian targets requires an efficient and numerically stable, yet expressive approximation of the covariance matrix. We propose SCORE: a scalable framework, combining scoring rule training with an expressive covariance approximation learned in s...

Christopher Bulte, Emil Partow, Astha Gupta et al. · 0 citations
#machine learning Preprint Oct 2026

Random Projections for Spectral Algorithms: Optimal Rates in Sobolev Norms

Random projections (RP) offer an effective method for reducing computational and storage overhead while preserving the geometric structure of data. However, existing studies have primarily focused on the optimal generalization performance of specific kernel-regularized algorithms with RP in the well-specified setting a...

Cai-Hong Wang, Yue Wang · 0 citations
Preprint Sep 2026

Oracle high-dimensional $M$-estimation using smooth reparameterization for sparsity

This paper establishes a unified non-linear regularization framework for high-dimensional $M$-estimation, encompassing both linear regression and Cox's proportional hazards models. Rather than relying on traditional additive non-convex penalties, the proposed paradigm embeds sparsity directly into the parameter mapping...

Y. Nishiyama · 0 citations
Preprint Oct 2026

Positive, monotone, and convex Gaussian process regression with Laplacian eigenfunctions

We study how to condition an existing Hilbert space Gaussian process (HSGP) expansion on positivity, monotonicity, or convexity throughout an interval. The expansion has Gaussian coefficients whose variances are given by the kernel's spectral density. At fixed covariance and noise parameters, we retain this coefficient...

Andreas Kryger Jensen · 0 citations
Preprint Oct 2026

Geometry-Aware Block Selection for Sparse Variational Gaussian Processes

Sparse variational Gaussian processes (SVGPs) are a widely used, principled approach to scalable Gaussian process modelling. Their success stems from their theoretically interpretable structure: they provide a lower bound on the marginal likelihood of the full GP while allowing scal- able stochastic optimization. Recen...

M. Hoxha · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.