History Replays Itself: Unleashing Long-Context Capability in Linear Attention
Li Nanbo, Firas Laakom, Yilan Zhang, Piotr Piękos, Yimeng Chen, Liangyu Wang, Yifan Xu, Mateusz Ostaszewski et al. · KAUST Center of Excellence in Generative AI
11 Oct 2026 · cs.AI, cs.LG · laptop / colab · pretraining, data & scaling, architectures, efficiency & inference, long context & memory, retrieval & rag
13 hf upvotes · 0 hn points, 0 comments · 0 citations
Linear attention promises the efficiency needed for long-context language modelling, yet its fixed-size recurrent state must simultaneously support ongoing computation and preserve information from an ever-growing history. This coupling has reinforced a prevailing view that the state's memory capacity defines the model's long-context capability. We challenge this presumed ceiling: recurrent computation need not bear the full burden of long-term storage. We introduce NoteBank, a sparse episodic memory that archives selected text before future queries are known, uses the backbone's native features for writing and addressing, and reads retrieved evidence through its native forward computation via replay. This training-free, plug-and-play interface requires no external embedding model, separately trained retriever, or separate neural reader. At one million tokens, it raises Gated DeltaNet's mean accuracy across six RULER retrieval tasks from 1.7% to 70.3%, with no observed significant retrieval degradation from 4K to 1M tokens. This recovery adds $\leqslant$0.025% to analytical FLOPs, with persistent context storage approximately 1/2,600 that of a Transformer's full MHA KV cache at matched width, depth, and precision. Experiments extend from three 1.3B recurrent backbones to Mamba-2-8B and post-trained Qwen3.5-9B, demonstrating gains on LongBench v1/v2 and MemoryAgentBench. Together, these results show that sparse evidence storage and native replay can substantially expand the long-context capability of pretrained linear attention models while retaining the efficiency of recurrent computation.
Compute guess: laptop / colab. Based on: smallest model mentioned ~1.3B params; training-free / inference-time method. (estimated from the abstract)
Potential
signals behind the hidden gems rankingshares 9 authors with “JevGPT: Thinking Fast and Slow in Autonomous Research” (33 upvotes/points)
Existing reproductions
Not checked yet. Looks for GitHub repos that cite this arXiv id and HF models tagged with it, then separates independent reproductions from code that only cites or uses the paper, and from paper lists.
Comments