|
|
||||||||
Neural Computation, Vol 10, 2137-2157, Copyright © 1998 by The MIT Press
LETTERS |
Howard Hua Yang and Shun-ichi Amari
The natural gradient descent method is applied to train an n-m-1 mul-tilayer perceptron. Based on an efficient scheme to represent the Fisher information matrix for an n-m-1 stochastic multilayer perceptron, a new algorithm is proposed to calculate the natural gradient without inverting the Fisher information matrix explicitly. When the input dimension n is much larger than the number of hidden neurons m, the time complexity of computing the natural gradient is O(n).
This article has been cited by other articles:
![]() |
N. N. Schraudolph Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent Neural Comput., July 1, 2002; 14(7): 1723 - 1738. [Abstract] [Full Text] [PDF] |
||||
![]() |
S.-i. Amari, H. Park, and K. Fukumizu Adaptive Method of Realizing Natural Gradient Learning for Multilayer Perceptrons Neural Comput., June 1, 2000; 12(6): 1399 - 1409. [Abstract] [Full Text] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |