Unbiased Stochastic Optimization for Gaussian Processes on Finite Dimensional RKHS
Not on the map. Why?
Abstract (arXiv)
Current methods for stochastic hyperparameter learning in Gaussian Processes (GPs) rely on approximations, such as computing biased stochastic gradients or using inducing points in stochastic variational inference. However, when using such methods we are not guaranteed to converge to a stationary point of the true marginal likelihood. In this work, we propose algorithms for exact stochastic inference of GPs with kernels that induce a Reproducing Kernel Hilbert Space (RKHS) of moderate finite dimension. Our approach can also be extended to infinite dimensional RKHSs at the cost of forgoing exactness. Both for finite and infinite dimensional RKHSs, our method achieves better experimental results than existing methods when memory resources limit the feasible batch size and the possible number of inducing points.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 31 references that are in the map. First posted on arXiv 28 Aug 2025.
Builds on
16 of 31 references.
References · 16
- 2016Training Deep Nets with Sublinear Memory Costcited by 848
- 2015Deep Kernel Learningcited by 445
- 2013Gaussian Processes for Big Datacited by 383
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 270
- 2014Scalable Variational Gaussian Process Classificationcited by 228
- 2018When Gaussian Process Meets Big Data: A Review of Scalable GPscited by 206
- 2015Kernel Interpolation for Scalable Structured Gaussian Processes (KISS-GP)cited by 177
- 2019Exact Gaussian Processes on a Million Data Pointscited by 119
- 2014Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functionscited by 95
- 2016Stochastic Variational Deep Kernel Learningcited by 93
- 2014Manifold Gaussian Processes for Regressioncited by 80
- 2020Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problemscited by 77
4 more
- 2018Semi-supervised Deep Kernel Learning: Regression with Unlabeled Data by Minimizing Predictive Variancecited by 34
- 2020Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problemscited by 26
- 2014A la Carte - Learning Fast Kernelscited by 18
- 2021Gauss-Legendre Features for Gaussian Process Regressioncited by 5
Built on by
Not cited yet.