LSTM Gradient Flow › Historical Context and Influence
Language AI HandbookAll chapters LSTM Gradient Flow › Historical Context and InfluenceOne section · Sections in this chapter14 / 17 ↓
Reading tools Definitions & inline links
Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.
Article links
Make inline references clickable
The constant error carousel appeared in print in 1997, in the journal Neural Computation. At that time, sequence modeling was dominated by Hidden Markov Models and early connectionist approaches, and the vanishing gradient problem was widely acknowledged as a severe obstacle but not yet solved in a principled way. The LSTM paper made several contributions simultaneously: it diagnosed the problem mathematically, designed an architecture that addressed it, and demonstrated the architecture on tasks that required memory of hundreds of timesteps, tasks that were completely out of reach for vanilla RNNs.
The 1997 paper did not yet include the forget gate. The original LSTM used a constant memory cell with only input and output gates, relying on a linear recurrence to prevent gradient decay. The forget gate was added by Gers et al. in 2000 in their "Learning to Forget: Continual Prediction with LSTM" paper. This addition turned out to be critical: without the ability to actively forget, the LSTM cell state would accumulate information indefinitely, causing problems for tasks with natural reset points like paragraph boundaries or topic changes.
The decade following the original paper saw steady but moderate adoption. LSTMs were applied to handwriting recognition, speech recognition, and language modeling, achieving state-of-the-art results in each domain. But the breakthrough that brought LSTMs into mainstream NLP was the sequence-to-sequence architecture introduced by Sutskever et al. in 2014. By using one LSTM to encode a source sentence into a fixed-size hidden state and another LSTM to decode the target sentence from that hidden state, they achieved dramatic improvements in machine translation.
The Attention Mechanism, introduced by Bahdanau et al. in 2015, extended sequence-to-sequence LSTMs further by allowing the decoder to attend to all encoder hidden states, rather than only the final one. This addressed a bottleneck in the LSTM encoder: the final hidden state could only carry a limited amount of information about the full input sequence. Attention made the encoder's entire hidden state sequence available to the decoder, dramatically improving performance on long sentences. The combination of LSTMs with attention became the dominant architecture for sequence-to-sequence tasks until Transformers arrived in 2017.
Understanding this historical progression is valuable because it illuminates the design decisions embedded in modern architectures. The Transformer's attention mechanism can be seen as taking the skip-connection insight from LSTM cell states and the attention insight from Bahdanau to their logical conclusion: every position can directly attend to every other position without any sequential bottleneck. The residual connections in Transformers mirror the LSTM cell state's additive gradient highway. The layer normalization in Transformers addresses the same training stability concern that motivated forget gate bias initialization in LSTMs. These connections are not coincidental; they reflect a continuous evolutionary thread in how the field has approached gradient flow and training stability.