MemoryLLM: Plug-n-Play Interpretable Feed-Forward Memory for Transformers
Not on the map. Why?
Abstract (arXiv)
Understanding how transformer components operate in LLMs is important, as it is at the core of recent technological advances in artificial intelligence. In this work, we revisit the challenges associated with interpretability of feed-forward modules (FFNs) and propose MemoryLLM, which aims to decouple FFNs from self-attention and enables us to study the decoupled FFNs as context-free token-wise neural retrieval memory. In detail, we investigate how input tokens access memory locations within FFN parameters and the importance of FFN memory across different downstream tasks. MemoryLLM achieves context-free FFNs by training them in isolation from self-attention directly using the token embeddings. This approach allows FFNs to be pre-computed as token-wise lookups (ToLs), enabling on-demand transfer between VRAM and storage, additionally enhancing inference efficiency. We also introduce Flex-MemoryLLM, positioning it between a conventional transformer design and MemoryLLM. This architecture bridges the performance gap caused by training FFNs with context-free token-wise embeddings.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 42 of its 46 references that are in the map. First posted on arXiv 30 Jan 2026.
Builds on
42 of 46 references.
References · 42
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2023Toolformer: Language Models Can Teach Themselves to Use Toolscited by 4,072
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2024Mixtral of Expertscited by 1,785
- 2020GLU Variants Improve Transformercited by 1,724
- 2021WebGPT: Browser-assisted question-answering with human feedbackcited by 1,722
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
30 more
- 2021Improving language models by retrieving from trillions of tokenscited by 1,278
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 788
- 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
- 2020How Much Knowledge Can You Pack Into the Parameters of a Language Model?cited by 713
- 2014Neural Turing Machinescited by 630
- 2020KILT: a Benchmark for Knowledge Intensive Language Taskscited by 571
- 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 522
- 2014Memory Networkscited by 354
- 2019A Multiscale Visualization of Attention in the Transformer Modelcited by 292
- 2024DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Headscited by 283
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2024Nemotron-4 340B Technical Reportcited by 143
- 2022Analyzing Transformers in Embedding Spacecited by 131
- 2019Large Memory Layers with Product Keyscited by 120
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
- 2019Augmenting Self-attention with Persistent Memorycited by 92
- 2024Mixture of A Million Expertscited by 70
- 2023Shall We Pretrain Autoregressive Language Models with Retrieval? A Comprehensive Studycited by 63
- 2024Understanding Factual Recall in Transformers via Associative Memoriescited by 45
- 2023LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compressioncited by 26
- 2023Cuttlefish: Low-Rank Model Training without All the Tuningcited by 25
- 2025Apple Intelligence Foundation Language Models: Tech Report 2025cited by 25
- 2024From Low Rank Gradient Subspace Stabilization to Low-Rank Weights: Observations, Theories, and Applicationscited by 24
- 2024FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skippingcited by 23
- 2025Mixture of Lookup Expertscited by 11
- 2025Instella: Fully Open Language Models with Stellar Performancecited by 4
- 2025Pre-trained Models Perform the Best When Token Distributions Follow Zipf's Lawcited by 3
- 2022Pragmatic Constraint on Distributional Semanticscited by 2
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Memory for Large Language Modelscited by 2
- 2026TIDE: Every Layer Knows the Token Beneath the Contextcited by 0
- 2026More Than Memory: Task-Conditioned Signed FFN Writes in Long-Context Retrievalcited by 0
- 2026Memory for Large Language Models28 Jul 2026
- 2026More Than Memory: Task-Conditioned Signed FFN Writes in Long-Context Retrieval27 Jun 2026
- 2026TIDE: Every Layer Knows the Token Beneath the Context7 May 2026