Fast Gaussian process inference by exact Mat'ern kernel decomposition
Not on the map. Why?
Abstract (arXiv)
To speed up Gaussian process inference, a number of fast kernel matrix-vector multiplication (MVM) approximation algorithms have been proposed over the years. In this paper, we establish an exact fast kernel MVM algorithm based on exact kernel decomposition into weighted empirical cumulative distribution functions, compatible with a class of kernels which includes multivariate Mat'ern kernels with half-integer smoothness parameter. This algorithm uses a divide-and-conquer approach, during which sorting outputs are stored in a data structure. We also propose a new algorithm to take into account some linear fixed effects predictor function. Our numerical experiments confirm that our algorithm is very effective for low-dimensional Gaussian process inference problems with hundreds of thousands of data points. An implementation of our algorithm is available at https://gitlab.com/warin/fastgaussiankernelregression.git.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 61 references that are in the map. First posted on arXiv 3 Aug 2025.
Builds on
29 of 61 references.
References · 29
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 609
- 2018When Gaussian Process Meets Big Data: A Review of Scalable GPscited by 206
- 2016GPflow: A Gaussian process library using TensorFlowcited by 140
- 2019Exact Gaussian Processes on a Million Data Pointscited by 119
- 2020Kernel Operations on the GPU, with Autodiff, without Memory Overflowscited by 104
- 2020Kernel methods through the roof: handling billions of points efficientlycited by 89
- 2015Distributed Gaussian Processescited by 84
- 2017FALKON: An Optimal Large Scale Kernel Methodcited by 84
- 2021A survey on high-dimensional Gaussian process modeling with application to Bayesian optimizationcited by 77
- 2017A general framework for Vecchia approximations of Gaussian processescited by 67
- 2013Local Gaussian process approximation for large computer experimentscited by 59
17 more
- 2017A Case Study Competition Among Methods for Analyzing Large Spatial Datacited by 44
- 2018Product Kernel Interpolation for Scalable Gaussian Processescited by 31
- 2020Gaussian Process Boostingcited by 26
- 2021Preconditioning for Scalable Gaussian Process Hyperparameter Optimizationcited by 23
- 2021Conditioning Sparse Variational Gaussian Processes for Online Decision-makingcited by 23
- 2021When are Iterative Gaussian Processes Reliably Accurate?cited by 12
- 2019Gaussian Process Learning via Fisher Scoring of Vecchia's Approximationcited by 10
- 2022Exact Gaussian Processes for Massive Datasets via Non-Stationary Sparsity-Discovering Kernelscited by 9
- 2021The Fast Kernel Transformcited by 8
- 2018Understanding and Comparing Scalable Gaussian Process Regression for Big Datacited by 5
- 2020Fast multivariate empirical cumulative distribution function with connection to kernel density estimationcited by 5
- 2024A spectral mixture representation of isotropic kernels with application to random Fourier featurescited by 5
- 2024Iterative Methods for Full-Scale Gaussian Process Approximations for Large Spatial Datacited by 4
- 2014A Comparison of Spatial Predictors when Datasets Could be Very Largecited by 3
- 2023Which Parameterization of the Mat'ern Covariance Function?cited by 3
- 2019Large-scale Environmental Data Science with ExaGeoStatRcited by 2
- 2022Giga-scale Kernel Matrix Vector Multiplication on GPUcited by 1
Built on by
Not cited yet.