English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Sparse Multiscale Gaussian Process Regression

Walder, C., Kim, K., & Schölkopf, B.(2007). Sparse Multiscale Gaussian Process Regression (162). Tübingen, Germany: Max Planck Institute for Biological Cybernetics.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0013-CC4F-6 Version Permalink: http://hdl.handle.net/21.11116/0000-0003-1DD3-F
Genre: Report

Files

show Files
hide Files
:
MPIK-TR-162.pdf (Publisher version), 330KB
Name:
MPIK-TR-162.pdf
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Walder, C1, 2, Author              
Kim, KI1, 2, Author              
Schölkopf, B1, 2, Author              
Affiliations:
1Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              
2Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              

Content

show
hide
Free keywords: -
 Abstract: 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. Although we focus on g.p. regression, the central idea is applicable to all kernel based algorithms, such as the support vector machine. 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. Our approach outperforms the other methods, particularly for the case of very few basis functions, i.e. a very high sparsity ratio.

Details

show
hide
Language(s):
 Dates: 2007-08
 Publication Status: Published in print
 Pages: 14
 Publishing info: Tübingen, Germany : Max Planck Institute for Biological Cybernetics
 Table of Contents: -
 Rev. Method: -
 Identifiers: Report Nr.: 162
BibTex Citekey: 5102
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Technical Report of the Max Planck Institute for Biological Cybernetics
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 162 Sequence Number: - Start / End Page: - Identifier: -