Abstract
We develop an approach for sparse representations of Gaussian Process (GP) models (which are Bayesian types of kernel machines) in order to overcome their limitations for large data sets. The method is based on a combination of a Bayesian online algorithm together with a sequential construction of a relevant subsample of the data which fully specifies the prediction of the GP model. By using an appealing parametrisation and projection techniques that use the RKHS norm, recursions for the effective parameters and a sparse Gaussian approximation of the posterior process are obtained. This allows both for a propagation of predictions as well as of Bayesian error measures. The significance and robustness of our approach is demonstrated on a variety of experiments.
| Original language | English |
|---|---|
| Pages (from-to) | 641-668 |
| Number of pages | 28 |
| Journal | Neural Computation |
| Volume | 14 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Mar 2002 |
Keywords
- sparse representations
- Gaussian Process
- large data sets
- online algorithm
Fingerprint
Dive into the research topics of 'Sparse on-line Gaussian processes'. Together they form a unique fingerprint.Research output
- 658 Citations
- 1 Technical report
-
Sparse on-line Gaussian processes
Csató, L. & Opper, M., 9 Sept 2002, Birmingham: Aston University, 18 p.Research output: Preprint or Working paper › Technical report
Open AccessFile
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver