Scinovex
articleTop 10% cited

An Efficient Gradient-Based Algorithm for On-Line Training of Recurrent Network Trajectories

Neural Computation · 1990 · Vol. 2(4) · pp. 490–501
Ronald J. WilliamsJing Peng

Abstract

A novel variant of the familiar backpropagation-through-time approach to training recurrent networks is described. This algorithm is intended to be used on arbitrary recurrent networks that run continually without ever being reset to an initial state, and it is specifically designed for computationally efficient computer implementation. This algorithm can be viewed as a cross between epochwise backpropagation through time, which is not appropriate for continually running networks, and the widely used on-line gradient approximation technique of truncated backpropagation through time.

Neural Networks and ApplicationsModel Reduction and Neural NetworksNeural Networks and Reservoir ComputingBackpropagationComputer scienceArtificial neural networkReset (finance)Line (geometry)AlgorithmArtificial intelligenceTraining (meteorology)Mathematics
Citations
592
FWCI
8.61
field-weighted impact
References
10
Percentile
98%
vs. same field & year
Citations per year
Cited by
LSTM recurrent networks learn simple context-free and context-sensitive languages
IEEE Transactions on Neural Networks · 2001 · 724 citations
Deep learning in neural networks: An overview
Neural Networks · 2014 · 17,774 citations
Learning to Forget: Continual Prediction with LSTM
Neural Computation · 2000 · 5,306 citations
Long Short-Term Memory
Neural Computation · 1997 · 95,078 citations
References
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.