1990

Backpropagation Through Time: What It Does and How to Do It

P. Werbos

citations

Cite Score

79

AI summary

This paper reviews basic backpropagation, presents the basic equations for back-propagation through time, and discusses applications to areas like pattern recognition involving dynamic systems, systems identification, and control. Pseudocode is provided to clarify the algorithms. The chain rule for ordered derivatives the theorem which underlies backpropagation is briefly discussed.

Main Contributions

  • Reviews basic backpropagation, a simple method which is now being widely used in areas like pattern recognition and fault diagnosis.
  • Presents the basic equations for back-propagation through time, and discusses applications to areas like pattern recognition involving dynamic systems, systems identification, and control.
  • Describes 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 which arise with this method.
  • Provides pseudocode is provided to clarify the algorithms.
  • Presents the chain rule for ordered derivatives the theorem which underlies backpropagation-is briefly discussed.

Abstract

Backpropagation is now the most widely used tool in the field of artificial neural networks. At the core of backpropagation is a method for calculating derivatives exactly and efficiently in any large system made up of elementary subsystems or calculations which are represented by known, differentiable functions; thus, backpropagation has many applications which do not involve neural networks as such. This paper first reviews basic backpropagation, a simple method which is now being widely used in areas like pattern recognition and fault diagnosis. Next, it presents the basic equations for back-propagation through time, and discusses applications to areas like pattern recognition involving dynamic systems, systems identification, and control. Finally, it describes 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 which arise with this method. Pseudocode is provided to clarify the algorithms. The chain rule for ordered derivatives the theorem which underlies backpropagation-is briefly discussed.

Citation Graph

Loading graph...

References [24]

Sort:
Filter:

D. E. Rumelhart, Geoffrey E. Hinton, Ronald J. Williams - 1986

46 papers in library cite

Fernando J. Pineda - 1987

5 papers in library cite

Paul J. Werbos - 1988

11 papers in library cite

Yann Lecun - 1985

5 papers in library cite

R. Watrous, Lokendra Shastri - 1987

4 papers in library cite

P. Werbos - 1974

14 papers in library cite

D. B. Parker - 1985

8 papers in library cite

B. A. Pearlmutter - 1989

5 papers in library cite

J. Dennis, R. Schnabel - 1983

3 papers in library cite

R. Williams - 1990

2 papers in library cite

P. Werbos - 1982

2 papers in library cite

P. Werbos - 1988

2 papers in library cite

I. Guyon, I. Poujaud, L. Personnaz, G. Dreyfus, John Denker, Yann Lecun - 1989

2 papers in library cite

R. Narendra - 1990

1 paper in library cites

D. Shanno - 1978

1 paper in library cites

P. Werbos - 1990

1 paper in library cites

M. Jordan - 1989

1 paper in library cites

H. Sawai, A. Waibel, Patrick Haffner, M. Miyatake, K. Shikano - 1989

1 paper in library cites

D. Shanno - 1990

1 paper in library cites

D. Nguyen, B. Widrow - 1990

1 paper in library cites

Cited by

9

papers in your library

Cites

6

papers in your library

Read

on June 23, 2025

Your review

Tags

Paper Aliases

No aliases