Back to the reading lists

    Deep learning· 1986

    Learning representations by back-propagating errors

    David E. Rumelhart (first author) · 1986

    Read the original

    DOI 10.1038/323533a0OpenAlex W1498436455

    Send error backward.

    On the reading lists

    Why it matters

    Popularized efficient training of multilayer networks, enabling learned internal representations and modern deep learning.

    Condensed from the expert lists' notes.

    Inside the paper

    The problem
    A network with hidden units can express relationships that direct input-to-output connections cannot. The challenge is deciding how to change hidden connections when the desired answers specify only the output.
    The idea
    The authors propagate derivatives of output error backwards through the network, giving each connection a direction in which to adjust. This lets hidden units develop internal representations suited to a task.
    How it works
    • Present an input and compute each unit’s output from its weighted inputs and nonlinear activation function.
    • Compare output activations with their desired values to calculate an error for the example.
    • Apply the chain rule backwards from the output to hidden units, calculating how each unit and connection contributes to error.
    • Accumulate weight derivatives over the examples and adjust weights downhill, using a momentum term to carry some of the preceding update forward.
    What it showed
    The paper demonstrates networks learning mirror symmetry and family relationships, and examines the structure of the representations they form. Figure 1 shows a symmetry solution in which paired input weights have opposite signs.
    Read it for
    Start on the first page of the article with the forward and backward equations, then examine Figures 1 and 2 and the accompanying examples. The detailed weight-update algebra can be revisited after you see what the hidden units learn.

    Written in our own words from the paper itself. A draft the editors have not yet reviewed.

    Earlier work

    Earlier papers that introduced a related idea. Listed for the record; they do not change the rank.

    • The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors (Seppo Linnainmaa, 1970). Published reverse-mode automatic differentiation, the algorithm behind backpropagation, sixteen years earlier. Source: Wikipedia: Backpropagation (research report 03, C-05)

    Reading it

    Difficulty: Introductory

    Read this first: calculus; the perceptron.

    The record

    First released
    1986 (from OpenAlex)
    Citations
    31,877 citations, as counted by OpenAlex (CC0)
    Named by
    both expert lists
    Also relevant to
    Computer vision & multimodal
    Score
    0.750 · computed rank 30 · consensus 1, must-read 1, citations percentile 1 (1980s · deep-learning), awards 0, existing lists 0. Method

    Editor's notes

    • Readability check: pass: Four pages that teach backpropagation as it is still used. (AI draft (Claude), not yet reviewed, 2026-10-29)

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.