Double-Take: Improving Capacity, Binding, and Selectivity In Long-Context Within Bidirectional Memory
cs.LG, q-bio.GN, q-bio.QM
Submitted: 2026-10-09
Updated: 2026-10-09
Comments: 23 pages, 4 figures, 15 tables
License: http://creativecommons.org/licenses/by/4.0/
The gist: Processing a long sequence does not guarantee that distant information remains usable.
Abstract
Processing a long sequence does not guarantee that distant information remains usable. As context grows, a fixed-size memory must retain many associations, connect information across positions, and preserve relevant structure without being overwhelmed by everything it observes. These are distinct requirements: a memory may store more information without representing the relationships needed for retrieval, and it may transport those relationships without preserving the ones that matter. Thus, the challenge is not simply extending context length, but constructing a memory that remains usable as context grows. We study this problem in large-chunk test-time training (TTT) and identify two basic failures: single-step writes accumulate interference, limiting capacity, while self-associative writes cannot form cross-position bindings. We introduce Double-Take (DT), which repairs these failures with multi-step unpinned updates and cross-position mixing, and adds bidirectional change-sensitive writes for selective retention. Capacity alone leaves end-to-end recall at the 0.10 chance floor; adding binding raises it to 0.92. Trained only on 32, kb genomic contexts, DT reaches 0.927 AUROC at 131, kb and 0.856 near 1, Mb, while transferring zero-shot from human to mouse. Together, these results identify capacity, binding, and selectivity as three requirements for usable long-range memory.
Sources
- Zoology: Measuring and Improving Recall in Efficient Language Models
- Simple linear attention language models balance the recall-throughput tradeoff
- Mamba: Linear-Time Sequence Modeling with Selective State Spaces
- RULER: What's the Real Context Size of Your Long-Context Language Models?
- Repeat After Me: Transformers are Better than State Space Models at Copying
- Compressive Transformers for Long-Range Sequence Modelling
- Learning to (Learn at Test Time): RNNs with Expressive Hidden States
- Memorizing Transformers
- Test-Time Training Done Right
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks