Sparse multiscale Gaussian process regression

Walder, Christian and Kim, Kwang In and Schölkopf, Bernhard (2008) Sparse multiscale Gaussian process regression. In: Proc. International Conference on Machine Learning (ICML) 2008. Max Planck Institute for Biological Cybernetics, Tuebingen, Germany, pp. 1112-1119. ISBN 9781605582054

Full text not available from this repository.


Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of the g.p. with one of its two inputs fixed. We generalise this for the case of Gaussian covariance function, by basing our computations on m Gaussian basis functions with arbitrary diagonal covariance matrices (or length scales). For a fixed number of basis functions and any given criteria, this additional flexibility permits approximations no worse and typically better than was previously possible. We perform gradient based optimisation of the marginal likelihood, which costs O(m2n) time where n is the number of data points, and compare the method to various other sparse g.p. methods. Although we focus on g.p. regression, the central idea is applicable to all kernel based algorithms, and we also provide some results for the support vector machine (s.v.m.) and kernel ridge regression (k.r.r.). Our approach outperforms the other methods, particularly for the case of very few basis functions, i.e. a very high sparsity ratio.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
Deposited By:
Deposited On:
03 Jul 2014 11:09
Last Modified:
16 Sep 2023 03:04