Fast Gaussian process inference by exact Matérn kernel decomposition

Nicolas Langrené, Xavier Warin, Pierre Gruet
8/3/2025
stat.MLcs.DScs.LG

No confident code implementation found for this paper.

Abstract

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érn 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{langren2025fast,
  title  = {Fast Gaussian process inference by exact Matérn kernel decomposition},
  author = {Nicolas Langrené and Xavier Warin and Pierre Gruet},
  year   = {2025},
  eprint = {2508.01864},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.01864v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.01864.svg)](https://codeofpaper.com/paper/2508.01864)

Discussion