|
|
||||||||
Letter |
Neural Computing Research Group, Department of Computer Science and Applied Mathematics, Aston University, Birmingham B4 7ET, U.K.
Theoretical Physics, Lund University, S-223 62 Lund, Sweden, and
, Niels Bohr Institute, 2100 Copenhagen Ø, Denmark
We derive a mean-field algorithm for binary classification with gaussian processes that is based on the TAP approach originally proposed in statistical physics of disordered systems. The theory also yields an approximate leave-one-out estimator for the generalization error, which is computed with no extra computational cost. We show that from the TAP approach, it is possible to derive both a simpler "naive" mean-field theory and support vector machines (SVMs) as limiting cases. For both mean-field algorithms and support vector machines, simulation results for three small benchmark data sets are presented. They show that one may get state-of-the-art performance by using the leave-one-out estimator for model selection and the built-in leave-one-out estimators are extremely precise when compared to the exact leave-one-out estimate. The second result is taken as strong support for the internal consistency of the mean-field approach.
This article has been cited by other articles:
![]() |
H.-C. Kim and J. Lee Clustering Based on Gaussian Processes Neural Comput., November 1, 2007; 19(11): 3088 - 3107. [Abstract] [Full Text] [PDF] |
||||
![]() |
M. Girolami and S. Rogers Variational Bayesian Multinomial Probit Regression with Gaussian Process Priors Neural Comput., August 1, 2006; 18(8): 1790 - 1817. [Abstract] [Full Text] [PDF] |
||||
![]() |
P. A.d.F.R. Hojen-Sorensen, O. Winther, and L. K. Hansen Mean-Field Approaches to Independent Component Analysis Neural Comput., April 1, 2002; 14(4): 889 - 918. [Abstract] [Full Text] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |