Cited by 4,879Neural Networks and ApplicationsMachine Learning and ELMControl Systems and Identification

Backpropagation through time: what it does and how to do it

Werbos, P.J.·1990·Proceedings of the IEEE

Abstract

Basic backpropagation, which is a simple method now being widely used in areas like pattern recognition and fault diagnosis, is reviewed. The basic equations for backpropagation through time, and applications to areas like pattern recognition involving dynamic systems, systems identification, and control are discussed. Further extensions of this method, to deal with systems other than neural networks, systems involving simultaneous equations, or true recurrent networks, and other practical issues arising with the method are described. Pseudocode is provided to clarify the algorithms. The chain rule for ordered derivatives-the theorem which underlies backpropagation-is briefly discussed. The focus is on designing a simpler version of backpropagation which can be translated into computer code and applied directly by neutral network users.>

Integrity signals

Registry

Crossref · 10.1109/5.58337

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Backpropagation-through-time exploits the fact that a recurrent neural network can be regarded as a temporally unfolded feedforward neural network.

    “A standard algorithm for training a recurrent neural network, backpropagation-through-time, exploits the fact that a recurrent neural network can be regarded as a temporally unfolded feedforward neural network (Werbos, 1990).”

    From The Cerebro-Cerebellum as a Locus of Forward Model: A Review (2020) · cites this paper as Werbos, 1990

  • The biological implementations of backpropagation proposed above do not give a natural implementation of backpropagation through time for recurrent networks.

    “The biological implementations of backpropagation proposed above, while applicable to feedforward networks, do not give a natural implementation of “backpropagation through time” (BPTT) (Werbos, 1990) for recurrent networks”

    From Toward an integration of deep learning and neuroscience (2016) · cites this paper as Werbos, 1990

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Werbos, P. J.
Affiliations
U.S. National Science Foundation (US)
Corresponding author
Werbos, P.J.
Venue
Proceedings of the IEEE
Published
1990
Volume
78
Issue
10
Pages
1550-1560
ISSN
0018-9219 (ISSN-L)
OpenAlex
W2150355110
Cited by
4,879
References
25
Citations by year
2026: 161 · 2025: 244 · 2024: 309 · 2023: 352 · 2022: 298 · 2021: 392 · 2020: 380 · 2019: 366 · 2018: 335 · 2017: 227 · 2016: 220 · 2015: 113 · 2014: 86 · 2013: 61 · 2012: 69
FWCI
25.12
Type
journal article
Language
en
Open access
closed
Locations
Proceedings of the IEEE (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
  • Physical Sciences › Engineering › Control and Systems Engineering › Control Systems and Identification
Keywords
backpropagation through time, recurrent neural networks, dynamical systems, system identification, control, pattern recognition, fault diagnosis, systems of equations

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review