HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Andrieu, C. Articles by Doucet, A. Search for Related Content PubMed PubMed Citation Articles by Andrieu, C. Articles by Doucet, A.

Robust Full Bayesian Learning for Radial Basis Networks

Cambridge University Engineering Department, Cambridge CB2 1PZ, England

Nando de Freitas

Computer Science Division, University of California, Berkeley, CA 94720-1776, U.S.A.

Arnaud Doucet

Cambridge University Engineering Department, Cambridge CB2 1PZ, England

We propose a hierarchical full Bayesian model for radial basis networks. This model treats the model dimension (number of neurons), model parameters, regularization parameters, and noise parameters as unknown random variables. We develop a reversible-jump Markov chain Monte Carlo (MCMC) method to perform the Bayesian computation. We find that the results obtained using this method are not only better than the ones reported previously, but also appear to be robust with respect to the prior specification. In addition, we propose a novel and computationally efficient reversible-jump MCMC simulated annealing algorithm to optimize neural networks. This algorithm enables us to maximize the joint posterior distribution of the network parameters and the number of basis function. It performs a global search in the joint space of the parameters and number of parameters, thereby surmounting the problem of local minima to a large extent. We show that by calibrating the full hierarchical Bayesian prior, we can obtain the classical Akaike information criterion, Bayesian information criterion, and minimum description length model selection criteria within a penalized likelihood framework. Finally, we present a geometric convergence theorem for the algorithm with homogeneous transition kernel and a convergence theorem for the reversible-jump MCMC simulated annealing method.

This article has been cited by other articles:

				Y. Wang, X. Zhou, H. Wang, K. Li, L. Yao, and S. T.C. Wong Reversible jump MCMC approach for peak identification for stroke SELDI mass spectrometry using mixture model Bioinformatics, July 1, 2008; 24(13): i407 - i413. [Abstract] [Full Text] [PDF]