Real-Time Regression with Dividing Local Gaussian Processes

by   Armin Lederer, et al.

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.


page 1

page 2

page 3

page 4


Ensemble Kalman Filtering for Online Gaussian Process Regression and Learning

Gaussian process regression is a machine learning approach which has bee...

Modeling Ride-Sourcing Matching and Pickup Processes based on Additive Gaussian Process Models

Matching and pickup processes are core features of ride-sourcing service...

Splitting Gaussian Process Regression for Streaming Data

Gaussian processes offer a flexible kernel method for regression. While ...

Scalable Model-Based Gaussian Process Clustering

Gaussian process is an indispensable tool in clustering functional data,...

Overlapping Cover Local Regression Machines

We present the Overlapping Domain Cover (ODC) notion for kernel machines...

Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces

Graph models are relevant in many fields, such as distributed computing,...

Please sign up or login with your details

Forgot password? Click here to reset