Approximations for Binary Gaussian Process Classification

Nickisch, H; Rasmussen, CE

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Approximations for Binary Gaussian Process Classification

MPS-Authors

/persons/resource/persons84109

Nickisch, H
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

http://www.jmlr.org/papers/volume9/nickisch08a/nickisch08a.pdf
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Nickisch, H., & Rasmussen, C. (2008). Approximations for Binary Gaussian Process Classification. The Journal of Machine Learning Research, 9, 2035-2078.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-C69B-C

Abstract

We provide a comprehensive overview of many recent algorithms for approximate inference in
Gaussian process models for probabilistic binary classification. The relationships between several
approaches are elucidated theoretically, and the properties of the different algorithms are
corroborated by experimental results. We examine both 1) the quality of the predictive distributions and
2) the suitability of the different marginal likelihood approximations for model selection (selecting
hyperparameters) and compare to a gold standard based on MCMC. Interestingly, some methods
produce good predictive distributions although their marginal likelihood approximations are poor.
Strong conclusions are drawn about the methods: The Expectation Propagation algorithm is almost
always the method of choice unless the computational budget is very tight. We also extend
existing methods in various ways, and provide unifying code implementing all approaches.