Proteus: Incremental Memory Activation for Long-Context Sequence Modeling
Not on the map. Why?
Abstract (arXiv)
The quadratic cost of attention-based sequence models for long contexts has motivated a growing line of research on memory-based models that can compress context into a compact state. However, most existing memory models expose a static memory throughout the entire sequence. Because early tokens face no compression pressure, they occupy too many degrees of freedom and "pollute" the memory state, leaving little capacity for later context and increasing interference between what is stored and what arrives next. We study a new paradigm of incremental memory activation, where the effective capacity of memory is progressively expanded as the context grows. Imposing an early bottleneck forces the model to compress history more effectively, while unlocking fresh capacity over time reduces interference and improves retention of later context. We instantiate this paradigm in Proteus, a straightforward mechanism that can be incorporated into a broad class of neural memory architectures at no additional cost. We apply Proteus to state-of-the-art models, including SWLA, Comba, Titans, and Hope-Attention, and observe consistent improvements on standard language modeling and reasoning, as well as on long-context retrieval and understanding, with gains that grow at longer context lengths. Overall, our results show that static memory is suboptimal and that scheduling effective capacity is a simple and broadly applicable tool for sequence modeling.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 73 of its 86 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
73 of 86 references.
References · 73
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
38 more
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2022Simplified State Space Layers for Sequence Modelingcited by 788
- 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 613
- 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
- 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 514
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
- 2020Hopfield Networks is All You Needcited by 475
- 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 355
- 2024Titans: Learning to Memorize at Test Timecited by 328
- 2022Confident Adaptive Language Modelingcited by 310
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 258
- 2016Dense Associative Memory for Pattern Recognitioncited by 236
- 2019Depth-Adaptive Transformercited by 236
- 2024BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystackcited by 215
- 2024Simple linear attention language models balance the recall-throughput tradeoffcited by 208
- 2024The Illusion of State in State-Space Modelscited by 187
- 2015Conditional Computation in Neural Networks for faster modelscited by 167
- 2023Birth of a Transformer: A Memory Viewpointcited by 161
- 2024Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrencecited by 159
- 2025RWKV-7 "Goose" with Expressive Dynamic State Evolutioncited by 141
- 2022Liquid Structural State-Space Modelscited by 136
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
- 2025Test-Time Training Done Rightcited by 130
- 2023Uncovering mesa-optimization algorithms in Transformerscited by 100
- 2024Transformers need glasses! Information over-squashing in language taskscited by 91
- 2021Going Beyond Linear Transformers with Recurrent Fast Weight Programmerscited by 89
- 2025DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Productscited by 75
- 2025Test-time regression: a unifying framework for designing sequence models with associative memorycited by 74
- 2025Nested Learning: The Illusion of Deep Learning Architecturescited by 72
- 2025ATLAS: Learning to Optimally Memorize the Context at Test Timecited by 66
- 2025It's All Connected: A Journey Through Test-Time Memorization, Attentional Bias, Retention, and Online Optimizationcited by 64
- 2024Longhorn: State Space Models are Amortized Online Learnerscited by 59
- 2024Recurrent Neural Networks Learn to Store and Generate Sequences using Non-Linear Representationscited by 47
50 most cited of 73 All 73 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.