# Real-Time Regression with Dividing Local Gaussian Processes

arXiv: https://arxiv.org/abs/2006.09446 · HTML: https://mlsanity.com/paper/2006.09446/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Jun 2020.

## Built on by (most cited first, 5 of 5)

- [Automatic nonlinear MPC approximation with closed-loop guarantees](https://mlsanity.com/paper/2312.10199/) (2023)
- [Adaptive Sparse Gaussian Process](https://mlsanity.com/paper/2302.10325/) (2023)
- [Accurate Remaining Useful Life Prediction with Uncertainty Quantification: a Deep Learning and Nonstationary Gaussian Process Approach](https://mlsanity.com/paper/2109.12111/) (2021)
- [GPTreeO: An R package for continual regression with dividing local Gaussian processes](https://mlsanity.com/paper/2410.01024/) (2024)
- [Remaining useful life prediction with uncertainty quantification: development of a highly accurate model for rotating machinery](https://mlsanity.com/paper/2109.11579/) (2021)

## Abstract (arXiv)

The increased demand for online prediction and the growing availability of large data sets drives the need for computationally efficient models. While exact Gaussian process regression shows various favorable theoretical properties (uncertainty estimate, unlimited expressive power), the poor scaling with respect to the training set size prohibits its application in big data regimes in real-time. Therefore, this paper proposes dividing local Gaussian processes, which are a novel, computationally efficient modeling approach based on Gaussian process regression. Due to an iterative, data-driven division of the input space, they achieve a sublinear computational complexity in the total number of training points in practice, while providing excellent predictive distributions. A numerical evaluation on real-world data sets shows their advantages over other state-of-the-art methods in terms of accuracy as well as prediction and update speed.
