Gradient calculation for dynamic recurrent neural networks: a survey (1995)
| Venue: | IEEE Transactions on Neural Networks |
| Citations: | 119 - 1 self |
BibTeX
@ARTICLE{Pearlmutter95gradientcalculation,
author = {Barak A. Pearlmutter},
title = {Gradient calculation for dynamic recurrent neural networks: a survey},
journal = {IEEE Transactions on Neural Networks},
year = {1995}
}
Years of Citing Articles
OpenURL
Abstract
Abstract | We survey learning algorithms for recurrent neural networks with hidden units, and put the various techniques into a common framework. We discuss xedpoint learning algorithms, namely recurrent backpropagation and deterministic Boltzmann Machines, and non- xedpoint algorithms, namely backpropagation through time, Elman's history cuto, and Jordan's output feedback architecture. Forward propagation, an online technique that uses adjoint equations, and variations thereof, are also discussed. In many cases, the uni ed presentation leads to generalizations of various sorts. We discuss advantages and disadvantages of temporally continuous neural networks in contrast to clocked ones, continue with some \tricks of the trade" for training, using, and simulating continuous time and recurrent neural networks. We present somesimulations, and at the end, address issues of computational complexity and learning speed.







