Sequential Monte Carlo Methods to Train Neural Network Models

  • Authors:
  • J. F. G. De Freitas;M. A. Niranjan;A. H. Gee;A. Doucet

  • Affiliations:
  • Cambridge University Engineering Department, Cambridge CB2 1PZ, England, U.K.;Cambridge University Engineering Department, Cambridge CB2 1PZ, England, U.K.;Cambridge University Engineering Department, Cambridge CB2 1PZ, England, U.K.;Cambridge University Engineering Department, Cambridge CB2 1PZ, England, U.K.

  • Venue:
  • Neural Computation
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We discuss a novel strategy for training neural networks using sequential Monte Carlo algorithms and propose a new hybrid gradient descent / sampling importance resampling algorithm (HySIR). In terms of computational time and accuracy, the hybrid SIR is a clear improvement over conventional sequential Monte Carlo techniques. The new algorithm may be viewed as a global optimization strategy that allows us to learn the probability distributions of the network weights and outputs in a sequential framework. It is well suited to applications involving on-line, nonlinear, and nongaussian signal processing. We show how the new algorithm outperforms extended Kalman filter training on several problems. In particular, we address the problem of pricing option contracts, traded in financial markets. In this context, we are able to estimate the one-step-ahead probability density functions of the options prices.