Smooth Reading: Bridging the Gap of Recurrent LLM to Self-Attention LLM on Long-Context Tasks
Not on the map. Why?
Abstract (arXiv)
Recently, recurrent large language models (Recurrent LLMs) with linear computational complexity have re-emerged as efficient alternatives to self-attention-based LLMs (Self-Attention LLMs), which have quadratic complexity. However, Recurrent LLMs often underperform on long-context tasks due to their limited fixed-size memory. Previous research has primarily focused on enhancing the memory capacity of Recurrent LLMs through architectural innovations, but these approaches have not yet enabled Recurrent LLMs to match the performance of Self-Attention LLMs on long-context tasks. We argue that this limitation arises because processing the entire context at once is not well-suited for Recurrent LLMs. In this paper, we propose Smooth Reading, a chunk-wise inference method inspired by human reading strategies. Smooth Reading processes context in chunks and iteratively summarizes the contextual information, thereby reducing memory demands and making the approach more compatible with Recurrent LLMs. Our experimental results show that this method substantially narrows the performance gap between Recurrent and Self-Attention LLMs on long-context tasks, while preserving the efficiency advantages of Recurrent LLMs. Our Smooth Reading boosts SWA-3B-4k (a Recurrent LLM) from 5.68% lower to 3.61% higher performance than Self-Attention LLMs on LongBench. Besides, our method maintains the high efficiency, training 3x faster and inferring 2x faster at 64k context compared to Self-Attention LLMs. To our knowledge, this is the first work to achieve comparable performance using Recurrent LLMs compared with Self-Attention LLMs on long-context tasks. We hope our method will inspire future research in this area. To facilitate further progress, we will release code and dataset.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 37 of its 43 references that are in the map. First posted on arXiv 25 Jul 2025.
Builds on
37 of 43 references.
References · 37
- 2017Attention Is All You Needcited by 60,361
- 2023GPT-4 Technical Reportcited by 18,396
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2023Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflectioncited by 1,839
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
- 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,282
25 more
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 916
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2017The NarrativeQA Reading Comprehension Challengecited by 597
- 2019SAMSum Corpus: A Human-annotated Dialogue Dataset for Abstractive Summarizationcited by 535
- 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
- 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 514
- 2021A Dataset of Information-Seeking Questions and Answers Anchored in Research Paperscited by 486
- 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
- 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 396
- 2021QMSum: A New Benchmark for Query-based Multi-domain Meeting Summarizationcited by 365
- 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 355
- 2023RepoBench: Benchmarking Repository-Level Code Auto-Completion Systemscited by 353
- 2021Efficient Attentions for Long Document Summarizationcited by 345
- 2018Generating Wikipedia by Summarizing Long Sequencescited by 335
- 2025DeepResearcher: Scaling Deep Research via Reinforcement Learning in Real-world Environmentscited by 286
- 2024Chain of Agents: Large Language Models Collaborating on Long-Context Taskscited by 206
- 2024An Empirical Study of Mamba-based Language Modelscited by 186
- 2024Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrencecited by 159
- 2025RWKV-7 "Goose" with Expressive Dynamic State Evolutioncited by 141
- 2024HGRN2: Gated Linear RNNs with State Expansioncited by 127
- 2023LongCoder: A Long-Range Pre-trained Language Model for Code Completioncited by 112
- 2024CompAct: Compressing Retrieved Documents Actively for Question Answeringcited by 64
- 2025MoM: Linear Sequence Modeling with Mixture-of-Memoriescited by 47
- 2024Mix-of-Granularity: Optimize the Chunking Granularity for Retrieval-Augmented Generationcited by 23
- 2024Are Long-LLMs A Necessity For Long-Context Tasks?cited by 22
Built on by
Citing papers per year: 2025: 1.
1 paper.