Gauss-Legendre Features for Gaussian Process Regression
Not on the map. Why?
Abstract (arXiv)
Gaussian processes provide a powerful probabilistic kernel learning framework, which allows learning high quality nonparametric regression models via methods such as Gaussian process regression. Nevertheless, the learning phase of Gaussian process regression requires massive computations which are not realistic for large datasets. In this paper, we present a Gauss-Legendre quadrature based approach for scaling up Gaussian process regression via a low rank approximation of the kernel matrix. We utilize the structure of the low rank approximation to achieve effective hyperparameter learning, training and prediction. Our method is very much inspired by the well-known random Fourier features approach, which also builds low-rank approximations via numerical integration. However, our method is capable of generating high quality approximation to the kernel using an amount of features which is poly-logarithmic in the number of training points, while similar guarantees will require an amount that is at the very least linear in the number of training points when random Fourier features. Furthermore, the structure of the low-rank approximation that our method builds is subtly different from the one generated by random Fourier features, and this enables much more efficient hyperparameter learning. The utility of our method for learning with low-dimensional datasets is demonstrated using numerical experiments.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 11 of its 50 references that are in the map. First posted on arXiv 4 Jan 2021.
Builds on
11 of 50 references.
References · 11
- 2015Kernel Interpolation for Scalable Structured Gaussian Processes (KISS-GP)cited by 175
- 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 136
- 2015On the Error of Random Fourier Featurescited by 76
- 2018Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guaranteescited by 71
- 2014Quasi-Monte Carlo Feature Maps for Shift-Invariant Kernelscited by 41
- 2015Optimal Rates for Random Fourier Featurescited by 38
- 2017Scalable Log Determinants for Gaussian Process Kernel Learningcited by 34
- 2018Quadrature-based features for kernel approximationcited by 25
- 2017Gaussian Quadrature for Kernel Featurescited by 21
- 2017Spatial Mapping with Gaussian Processes and Nonstationary Fourier Featurescited by 16
- 2014High-performance Kernel Machines with Implicit Distributed Optimization and Randomizationcited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 2; 2025: 1.
5 papers.
- 2021Large-Scale Learning with Fourier Features and Tensor Decompositionscited by 14
- 2024On the design of scalable, high-precision spherical-radial Fourier featurescited by 2
- 2023Trigonometric Quadrature Fourier Features for Scalable Gaussian Process Regressioncited by 1
- 2024Exploiting Hankel-Toeplitz Structures for Fast Computation of Kernel Precision Matricescited by 0
- 2025Unbiased Stochastic Optimization for Gaussian Processes on Finite Dimensional RKHScited by 0
- 2025Unbiased Stochastic Optimization for Gaussian Processes on Finite Dimensional RKHS28 Aug 2025
- 2024On the design of scalable, high-precision spherical-radial Fourier features23 Aug 2024
- 2024Exploiting Hankel-Toeplitz Structures for Fast Computation of Kernel Precision Matrices5 Aug 2024
- 2023Trigonometric Quadrature Fourier Features for Scalable Gaussian Process Regression23 Oct 2023
- 2021Large-Scale Learning with Fourier Features and Tensor Decompositions3 Sep 2021