mlsanityData to 7 Oct 2026

Working Memory Connections for LSTM

arXiv 2109.00020 ↗First posted 31 Aug 2021cs.LG cs.CL cs.CVcited by 10

Not on the map. Why?

Abstract (arXiv)

Recurrent Neural Networks with Long Short-Term Memory (LSTM) make use of gating mechanisms to mitigate exploding and vanishing gradients when learning long-term dependencies. For this reason, LSTMs and other gated RNNs are widely adopted, being the standard de facto for many sequence modeling tasks. Although the memory cell inside the LSTM contains essential information, it is not allowed to influence the gating mechanism directly. In this work, we improve the gate potential by including information coming from the internal cell state. The proposed modification, named Working Memory Connection, consists in adding a learnable nonlinear projection of the cell content into the network gates. This modification can fit into the classical LSTM gates without any assumption on the underlying task, being particularly effective when dealing with longer sequences. Previous research effort in this direction, which goes back to the early 2000s, could not bring a consistent improvement over vanilla LSTM. As part of this paper, we identify a key issue tied to previous connections that heavily limits their effectiveness, hence preventing a successful integration of the knowledge coming from the internal cell state. We show through extensive experimental evaluation that Working Memory Connections constantly improve the performance of LSTMs on a variety of tasks. Numerical results suggest that the cell state contains useful information that is worth including in the gate structure.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 27 of its 45 references that are in the map. First posted on arXiv 31 Aug 2021.

Builds on

27 of 45 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  4. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  5. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  6. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  7. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
  8. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
  9. 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
  10. 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
  11. 2014CIDEr: Consensus-based Image Description Evaluationcited by 2,027
  12. 2015Show, Attend and Tell: Neural Image Caption Generation with Visual Attentioncited by 1,421
15 more
  1. 2017Bottom-Up and Top-Down Attention for Image Captioning and Visual Question Answeringcited by 1,310
  2. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,303
  3. 2014Deep Visual-Semantic Alignments for Generating Image Descriptionscited by 966
  4. 2014Show and Tell: A Neural Image Caption Generatorcited by 877
  5. 2016SPICE: Semantic Propositional Image Caption Evaluationcited by 820
  6. 2013Speech Recognition with Deep Recurrent Neural Networkscited by 666
  7. 2013Generating Sequences With Recurrent Neural Networkscited by 549
  8. 2015LSTM: A Search Space Odysseycited by 315
  9. 2015Unitary Evolution Recurrent Neural Networkscited by 291
  10. 2015A Simple Way to Initialize Recurrent Networks of Rectified Linear Unitscited by 130
  11. 2016VideoLSTM Convolves, Attends and Flows for Action Recognitioncited by 60
  12. 2017Gated Orthogonal Recurrent Units: On Learning to Forgetcited by 31
  13. 2018An Analysis of Neural Language Modeling at Multiple Scalescited by 31
  14. 2016Hierarchical Boundary-Aware Neural Encoder for Video Captioningcited by 20
  15. 2018h-detach: Modifying the LSTM Gradient Towards Better Optimizationcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 1; 2024: 1; 2025: 4; 2026: 1.

10 papers.