We consider the problem of developing rapid, stable, and scalable stochastic gradient descent algorithms for optimisation of very large nonlinear systems. Based on earlier work by Orr et al. on adaptive momentum--an efficient yet extremely unstable stochastic gradient descent algorithm--we develop a stabilised adaptive momentum algorithm that is suitable for noisy nonlinear optimisation problems. The stability is improved by introducing a forgetting factor 0 ? ? ? 1 that smoothes the trajectory and enables adaptation in non-stationary environments. The scalability of the new algorithm follows from the fact that at each iteration the multiplication by the curvature matrix can be achieved in O (n) steps using automatic differentiation tools. We illustrate the behaviour of the new algorithm on two examples: a linear neuron with squared loss and highly correlated inputs, and a multilayer perceptron applied to the four regions benchmark task.
Sharad Singhal,et al.
Training Multilayer Perceptrons with the Extende Kalman Algorithm
Todd K. Leen,et al.
Optimal Stochastic Search and Adaptive Momentum
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Nicol N. Schraudolph,et al.
Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
Barak A. Pearlmutter.
Fast Exact Multiplication by the Hessian
Barak A. Pearlmutter,et al.
Automatic Learning Rate Maximization in Large Adaptive Machines