Approximation bounds for some sparse kernel regression algorithms

Research output: Contribution to journalArticlepeer-review


Gaussian processes have been widely applied to regression problems with good performance. However, they can be computationally expensive. In order to reduce the computational cost, there have been recent studies on using sparse approximations in gaussian processes. In this article, we investigate properties of certain sparse regression algorithms that approximately solve a gaussian process. We obtain approximation bounds and compare our results with related methods.

Original languageEnglish (US)
Pages (from-to)3013-3042
Number of pages30
JournalNeural Computation
Issue number12
StatePublished - Dec 2002
Externally publishedYes

ASJC Scopus subject areas

  • Arts and Humanities (miscellaneous)
  • Cognitive Neuroscience


Dive into the research topics of 'Approximation bounds for some sparse kernel regression algorithms'. Together they form a unique fingerprint.

Cite this