Approximate algorithms for neural-Bayesian approaches

  • Authors:
  • Tom Heskes;Bart Bakker;Bert Kappen

  • Affiliations:
  • SNN, University of Nijmegen, Geert Grooteplein 21, 6525 EZ Nijmegen, The Netherlands;SNN, University of Nijmegen, Geert Grooteplein 21, 6525 EZ Nijmegen, The Netherlands;SNN, University of Nijmegen, Geert Grooteplein 21, 6525 EZ Nijmegen, The Netherlands

  • Venue:
  • Theoretical Computer Science - Natural computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe two specific examples of neural-Bayesian approaches for complex modeling tasks: survival analysis and multitask learning. In both cases, we can come up with reasonable priors on the parameters of the neural network. As a result, the Bayesian approaches improve their (maximum likelihood) frequentist counterparts dramatically. By illustrating their application on the models under study, we review and compare algorithms that can be used for Bayesian inference: Laplace approximation, variational algorithms, Monte Carlo sampling, and empirical Bayes.