Modular TTT: Rethinking Test-Time Training as Composable Modules
Not on the map. Why?
Abstract (arXiv)
Test-time training (TTT) views sequence modeling as an online learning problem in which fast weights are updated by an internal learning rule. Despite the growing number of TTT variants, existing approaches typically hard-code each variant separately, which makes it difficult to design new TTT methods and to isolate the role of each component. To address this, we propose Modular TTT, a framework that represents the inner learner as a directed acyclic graph and exposes the fast-weight network, loss function, learning rate, weight decay, and normalization as explicit design dimensions. Modular TTT automatically composes primitive-level train-view forward, train-view backward, and causal query-view rules into the full graph-level TTT computation, including the fast-weight state transition. Using Modular TTT, we systematically ablate the components of TTT and find that small learning-rate initialization, weight decay, and a single-layer nonlinearity improve performance, while MSE and inner-product losses perform similarly. Deeper fast-weight networks and normalization tend to hurt performance because they induce excessively large activations, while residual connections and gating provide little measurable benefit. Guided by these findings, we train the best resulting variant as 410M- and 1.45B-parameter models on 100B tokens, and observe training loss and benchmark performance comparable to Gated DeltaNet.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 46 of its 54 references that are in the map. First posted on arXiv 7 Aug 2026.
Builds on
46 of 54 references.
References · 46
- 2017Attention Is All You Needcited by 59,932
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
34 more
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2020GLU Variants Improve Transformercited by 1,724
- 2020Rethinking Attention with Performerscited by 1,584
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
- 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 594
- 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 490
- 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 483
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 471
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 397
- 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 373
- 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 329
- 2024Titans: Learning to Memorize at Test Timecited by 303
- 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 280
- 2016Deep Learning without Poor Local Minimacited by 233
- 2016Using Fast Weights to Attend to the Recent Pastcited by 161
- 2025RWKV-7 "Goose" with Expressive Dynamic State Evolutioncited by 134
- 2017Parallelizing Linear Recurrent Neural Nets Over Sequence Lengthcited by 126
- 2024HGRN2: Gated Linear RNNs with State Expansioncited by 122
- 2025Test-Time Training Done Rightcited by 121
- 2023Hierarchically Gated Recurrent Neural Network for Sequence Modelingcited by 100
- 2024Unlocking State-Tracking in Linear RNNs Through Negative Eigenvaluescited by 97
- 2021Going Beyond Linear Transformers with Recurrent Fast Weight Programmerscited by 84
- 2025Nested Learning: The Illusion of Deep Learning Architecturescited by 69
- 2025It's All Connected: A Journey Through Test-Time Memorization, Attentional Bias, Retention, and Online Optimizationcited by 60
- 2025ATLAS: Learning to Optimally Memorize the Context at Test Timecited by 57
- 2017Dynamic Evaluation of Neural Sequence Modelscited by 53
- 2025End-to-End Test-Time Training for Long Contextcited by 53
- 2022The Dual Form of Neural Networks Revisited: Connecting Test Time Predictions to Training Patterns via Spotlights of Attentioncited by 45
- 2025ViT3: Unlocking Test-Time Training in Visioncited by 15
- 2025TNT: Improving Chunkwise Training for Test-Time Memorizationcited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.