mlsanityData to 14 Oct 2026

How Linear Attention Remembers

arXiv 2609.33093 ↗First posted 27 Sep 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Linear attention replaces the growing key--value (KV) cache of standard attention with a fixed-size recurrent state, substantially reducing memory growth with context length. This efficiency, however, changes how past information is stored: many tokens must share and repeatedly update the same memory. We study how this recurrent state functions as a memory system. Using an analytical decomposition together with controlled causal interventions in pretrained GLA and GDN models, we trace how recalled information is written, retained, and later accessed. We find that fact-specific information enters recurrent memory through concentrated, content-dependent writes and is later accessed through concentrated query-time read pathways. Multiple facts can remain selectively accessible within the same state, yet their internal representations exhibit cross-fact causal coupling rather than independent KV-like storage. As memory load increases, both recall and targeted editability degrade, whereas elapsed context alone has a substantially smaller effect within the tested regime. Causal interventions on subsequent writes further show that interference is shaped by their overlap with existing memory. Finally, in hybrid architectures that combine recurrent layers with full attention, the runtime memory directly supporting recall shifts predominantly to the full-attention KV state. Together, these results reveal how fixed-size recurrent memory supports selective recall despite shared storage, while exposing the interference and capacity limits that distinguish it from token-addressable KV memory.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 28 references that are in the map. First posted on arXiv 27 Sep 2026.

Builds on

27 of 28 references.

References · 27

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  4. 2016Pointer Sentinel Mixture Modelscited by 3,096
  5. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  6. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
  7. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  8. 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
  9. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 832
  10. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
  11. 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
  12. 2022Efficiently Scaling Transformer Inferencecited by 539
15 more
  1. 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
  2. 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 514
  3. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
  4. 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 501
  5. 2023Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Timecited by 439
  6. 2021Causal Abstractions of Neural Networkscited by 422
  7. 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 396
  8. 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 359
  9. 2024MobileLLM: Optimizing Sub-billion Parameter Language Models for On-Device Use Casescited by 223
  10. 2024Simple linear attention language models balance the recall-throughput tradeoffcited by 208
  11. 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memorycited by 177
  12. 2024MiniCache: KV Cache Compression in Depth Dimension for Large Language Modelscited by 125
  13. 2021Going Beyond Linear Transformers with Recurrent Fast Weight Programmerscited by 89
  14. 2024What needs to go right for an induction head? A mechanistic study of in-context learning circuits and their formationcited by 89
  15. 2025Distilling On-device Language Models for Robot Planning with Minimal Human Interventioncited by 10

Built on by

Not cited yet.