Back to the reading lists

    Deep learning· 1997

    Long Short-Term Memory

    Sepp Hochreiter (first author) · 1997

    Read the original

    DOI 10.1162/neco.1997.9.8.1735OpenAlex W2064675550

    Gate access to memory.

    On the reading lists

    Why it matters

    Introduced gated memory cells, enabling effective learning of long-range sequential dependencies.

    Condensed from the expert lists' notes.

    Inside the paper

    The problem
    A recurrent network can carry information from earlier inputs, but training it to use that information after a long delay is difficult. In conventional recurrent training, error signals passed back over many steps can shrink or grow rapidly.
    The idea
    The paper combines memory cells with gates that control when information enters and leaves. A fixed self-connection gives each cell an internal path along which error can persist across time.
    How it works
    • A cell keeps an internal state that carries forward from one time step to the next through a fixed self-connection.
    • An input gate scales new information before it is added to that state, helping protect stored information from irrelevant inputs.
    • An output gate controls how much of the cell’s state is exposed to the rest of the network.
    • The learning algorithm adjusts weights using error signals while truncating certain gradient paths, preserving the constant error path through the cell.
    What it showed
    On artificial sequence tasks, the authors report more successful runs and faster learning than the compared recurrent methods. Their adding experiment also tests whether the network can retain marked real values over long sequences and combine them at the end.
    Read it for
    Start with Section 3 for the difficulty of long delays, then use Figure 1 and Section 4 to follow the cell and its gates. Section 5.4 gives a concrete task; the full update equations in Appendix A can wait for a closer reading.

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

    Reading it

    Difficulty: Advanced

    Read this first: recurrent networks; backpropagation through time.

    The record

    First released
    1997 (from OpenAlex)
    Citations
    102,283 citations, as counted by OpenAlex (CC0)
    Named by
    both expert lists
    Also relevant to
    Language, speech & LLMs
    Score
    0.782 · computed rank 18 · consensus 0.94, must-read 1, citations percentile 1 (1990s · deep-learning), awards 0, existing lists 0.5. Method

    Editor's notes

    • Readability check: pass: The gating idea behind recurrent nets; dense but worth the effort with the prerequisites. (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.