Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Williams, C. K. I.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Williams, C. K. I.

Neural Computation, Vol 10, 1203-1216, Copyright © 1998 by The MIT Press

LETTERS

Computation with Infinite Neural Networks

Christopher K. I. Williams

For neural networks with a wide class of weight priors, it can be shown that in the limit of an infinite number of hidden units, the prior over functions tends to a gaussian process. In this article, analytic forms are derived for the covariance function of the gaussian processes corresponding to networks with sigmoidal and gaussian hidden units. This allows predictions to be made efficiently using networks with an infinite number of hidden units and shows, somewhat paradoxically, that it may be easier to carry out Bayesian prediction with infinite networks rather than finite ones.


This article has been cited by other articles:


Home page
 Neural Comput.Home page
Z. Chen and S. Haykin
On Different Facets of Regularization Theory
Neural Comput., December 1, 2002; 14(12): 2791 - 2846.
[Abstract] [Full Text]

Home page
 Neural Comput.Home page
V. Tresp
A Bayesian Committee Machine
Neural Comput., November 1, 2000; 12(11): 2719 - 2741.
[Abstract] [Full Text]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1998 by The MIT Press.