1986

Learning Internal Representations by Error Propagation

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

citations

Cite Score

95

AI summary

This paper introduces the generalized delta rule for training multilayer networks with hidden units, showcasing its ability to learn complex mappings and internal representations, achieving results on XOR, encoding, and symmetry problems.

Main Contributions

  • Introduces the generalized delta rule, an extension of the delta rule for training multilayer feedforward networks with semilinear units.
  • Demonstrates the ability of the generalized delta rule to learn internal representations in hidden units.
  • Shows that the method implements a gradient descent in weight space.
  • Applies the learning rule to a variety of problems including XOR, parity, encoding, symmetry, and binary addition.
  • Discusses how the generalized delta rule can be extended to sigma-pi units and recurrent networks.

Abstract

We now have a rather good understanding of simple two-layer associative networks in which a set of input patterns arriving at an input layer are mapped directly to a set of output patterns at an output layer. Such networks have no hidden units. They involve only input and output units. In these cases there is no internal representation. The coding provided by the external world must suffice. These networks have proved useful in a wide variety of applications (cf. Chapters 2, 17, and 18). Perhaps the essential character of such networks is that they map similar input patterns to similar output patterns. This is what allows these networks to make reasonable generalizations and perform reasonably on patterns that have never before been presented. The similarity of patterns in a PDP system is determined by their overlap. The overlap in such networks is determined outside the learning system itself-by whatever produces the patterns. The constraint that similar input patterns lead to similar outputs can lead to an inability of the system to learn certain mappings from input to output. Whenever the representation provided by the outside world is such that the similarity structure of the input and output patterns are very different, a network without internal representations (i.e., a

Citation Graph

Loading graph...

References [11]

Sort:
Filter:

Yann Lecun - 1985

5 papers in library cite

M. Minsky, S. Papert - 1969

12 papers in library cite

D. E. Rumelhart, J. L. Mcclelland, P. R. Group - 1986

15 papers in library cite

D. B. Parker - 1985

8 papers in library cite

B. Widrow, H. E. Hoff - 1960

5 papers in library cite

J. Mcclelland - 1981

3 papers in library cite

Barto - 1985

1 paper in library cites

Ackley, Hinton, Sejnowski - 1985

1 paper in library cites

Missing year

Hinton, Sejnowski

1 paper in library cites

Kienker, Sejnowski, Hinton, Schumacher - 1985

1 paper in library cites

Cited by

46

papers in your library

Cites

4

papers in your library

Read

on June 24, 2025

Your review

Tags

Paper Aliases

No aliases