A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
Ronald J. Williams, David Zipser
Neural Computation · 1989 · 4,509 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Williams, R. J., & Zipser, D. (1989). A learning algorithm for continually running fully recurrent neural networks. Neural Computation, 1(2), 270–280. https://doi.org/10.1162/neco.1989.1.2.270
In text: (Williams & Zipser, 1989)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
The exact form of a gradient-following learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have (1) the advantage that they do not require a precisely defined training interval, operating while the network runs; and (2) the disadvantage that they require nonlocal communication in the network being trained and are computationally expensive. These algorithms allow networks having recurrent connections to learn complex tasks that require the retention of information over time periods having either fixed or indefinite length.
Related papers
Metadata from OpenAlex (CC0). Citations are generated from the published record.