mlsanityData to 7 Oct 2026

Complexity of Symbolic Representation in Working Memory of Transformer Correlates with the Complexity of a Task

arXiv 2406.14213 ↗First posted 20 Jun 2024cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Even though Transformers are extensively used for Natural Language Processing tasks, especially for machine translation, they lack an explicit memory to store key concepts of processed texts. This paper explores the properties of the content of symbolic working memory added to the Transformer model decoder. Such working memory enhances the quality of model predictions in machine translation task and works as a neural-symbolic representation of information that is important for the model to make correct translations. The study of memory content revealed that translated text keywords are stored in the working memory, pointing to the relevance of memory content to the processed text. Also, the diversity of tokens and parts of speech stored in memory correlates with the complexity of the corpora for machine translation task.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 24 references that are in the map. First posted on arXiv 20 Jun 2024.

Builds on

12 of 24 references.

References · 12

  1. 2017Attention Is All You Needcited by 59,932
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2020Longformer: The Long-Document Transformercited by 3,362
  4. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  5. 2020Big Bird: Transformers for Longer Sequencescited by 1,673
  6. 2014Neural Turing Machinescited by 630
  7. 2018When and Why are Pre-trained Word Embeddings Useful for Neural Machine Translation?cited by 125
  8. 2020Memory Transformercited by 74
  9. 2016Scaling Memory-Augmented Neural Networks with Sparse Reads and Writescited by 28
  10. 2016Hierarchical Memory Networkscited by 15
  11. 2017Memory Augmented Neural Networks with Wormhole Connectionscited by 15
  12. 2016Dynamic Neural Turing Machine with Soft and Hard Addressing Schemescited by 8

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.