Lazy Gaussian process committee for real-time online regression

7Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

Abstract

A significant problem of Gaussian process (GP) is its unfavorable scaling with a large amount of data. To overcome this issue, we present a novel GP approximation scheme for online regression. Our model is based on a combination of multiple GPs with random hyperparameters. The model is trained by incrementally allocating new examples to a selected subset of GPs. The selection is carried out efficiently by optimizing a submodular function. Experiments on real-world data sets showed that our method outperforms existing online GP regression methods in both accuracy and efficiency. The applicability of the proposed method is demonstrated by the mouse-trajectory prediction in an Internet banking scenario. Copyright © 2013, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite

CITATION STYLE

APA

Xiao, H., & Eckert, C. (2013). Lazy Gaussian process committee for real-time online regression. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013 (pp. 969–976). https://doi.org/10.1609/aaai.v27i1.8572

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free