Learning to Forget Attention: Memory Consolidation for Adaptive Compute Reduction
Not on the map. Why?
Abstract (arXiv)
Hybrid architectures combining state-space models with attention have achieved strong efficiency-quality tradeoffs, yet existing approaches either apply attention uniformly or learn static sparse patterns. This misses a key opportunity: attention demand should decrease over time as recurring patterns become familiar. We present a surprising finding from analyzing GPT-2 models: 88% of attention operations retrieve information already predictable from the model's hidden state, and this redundancy does not decrease during training. Motivated by this observation, we introduce textbfours (Consolidation-based Routing for Adaptive Memory), a biologically inspired memory consolidation mechanism that gradually distills episodic retrievals into parametric semantic memory. Unlike prior sparse attention methods, ours exhibits decreasing attention utilization over training, achieving a 37.8× reduction through a sharp phase transition at approximately 3K steps. We prove that this capability is impossible without consolidation: any static routing scheme requires Omega(f · n) attention for tasks with recurring patterns of frequency f. On our proposed SRCD benchmark, ours achieves 100% retrieval accuracy at 1.6% attention compute (vs. 68% for baselines), and consolidated patterns transfer to unseen tasks with 48--52% attention reduction without retraining. Remarkably, the learned consolidation dynamics quantitatively match human episodic-to-semantic memory transition curves from cognitive psychology (γ = 0.43 vs. γhuman ≈ 0.4--0.5). Code and benchmarks are available at [anonymized].
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 31 of its 47 references that are in the map. First posted on arXiv 12 Feb 2026.
Builds on
31 of 47 references.
References · 31
- 2017Attention Is All You Needcited by 59,932
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
19 more
- 2020Reformer: The Efficient Transformercited by 1,658
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2020Rethinking Attention with Performerscited by 1,584
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2016Progressive Neural Networkscited by 1,332
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2020Efficient Transformers: A Surveycited by 784
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 501
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2024Jamba: A Hybrid Transformer-Mamba Language Modelcited by 390
- 2024Repeat After Me: Transformers are Better than State Space Models at Copyingcited by 208
- 2021PonderNet: Learning to Pondercited by 156
- 2019Adaptive Attention Span in Transformerscited by 148
- 2020The Right Tool for the Job: Matching Model and Instance Complexitiescited by 125
- 2023Sparse Modular Activation for Efficient Sequence Modelingcited by 20
- 2025Efficient Unstructured Pruning of Mamba State-Space Models for Resource-Constrained Environmentscited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Eviction
- 2026Augmenting Attention with Exponentially Decaying Memory Improves Query-Aware KV Sparsity
- 2025LoLA: Low-Rank Linear Attention With Sparse Caching
- 2026Learning to Forget: Sleep-Inspired Memory Consolidation for Resolving Proactive Interference in Large Language Models
- 2026A Hippocampus for Linear Attention: An Exact Memory for What the Recurrent State Forgets
- 2026AB-Sparse: Sparse Attention with Adaptive Block Size for Accurate and Efficient Long-Context Inference
- 2026RAT+: Train Dense, Infer Sparse -- Recurrence Augmented Attention for Dilated Inference
- 2026RAM-Net: Linear-Time Sequence Modeling with Sparsely Addressable State