mlsanityData to 14 Oct 2026

Efficient Attention Mechanisms for Large Language Models: A Survey

arXiv 2507.19595 ↗First posted 25 Jul 2025cs.CL cs.AIcited by 22

Not on the map. Why?

Abstract (arXiv)

Transformer-based architectures have become the prevailing backbone of large language models. However, the quadratic time and memory complexity of self-attention remains a fundamental obstacle to efficient long-context modeling. To address this limitation, recent research has introduced two principal categories of efficient attention mechanisms. Linear attention methods achieve linear complexity through kernel approximations, recurrent formulations, or fastweight dynamics, thereby enabling scalable inference with reduced computational overhead. Sparse attention techniques, in contrast, limit attention computation to selected subsets of tokens based on fixed patterns, block-wise routing, or clustering strategies, enhancing efficiency while preserving contextual coverage. This survey provides a systematic and comprehensive overview of these developments, integrating both algorithmic innovations and hardware-level considerations. In addition, we analyze the incorporation of efficient attention into largescale pre-trained language models, including both architectures built entirely on efficient attention and hybrid designs that combine local and global components. By aligning theoretical foundations with practical deployment strategies, this work aims to serve as a foundational reference for advancing the design of scalable and efficient language models.

Key facts. Cited by 22 papers in the map (data through 14 Oct 2026). Builds on 73 of its 91 references that are in the map. First posted on arXiv 25 Jul 2025.

Builds on

73 of 91 references.

References · 73

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  5. 2020Longformer: The Long-Document Transformercited by 3,413
  6. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  7. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
  8. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
  9. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  10. 2025Gemma 3 Technical Reportcited by 1,824
  11. 2020Big Bird: Transformers for Longer Sequencescited by 1,684
  12. 2020Reformer: The Efficient Transformercited by 1,668
38 more
  1. 2020Rethinking Attention with Performerscited by 1,601
  2. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  3. 2018Group Normalizationcited by 1,524
  4. 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
  5. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  6. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  7. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
  8. 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
  9. 2020Efficient Transformers: A Surveycited by 790
  10. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
  11. 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 613
  12. 2019Enhancing the Locality and Breaking the Memory Bottleneck of Transformer on Time Series Forecastingcited by 607
  13. 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
  14. 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 514
  15. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
  16. 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 501
  17. 2022Hungry Hungry Hippos: Towards Language Modeling with State Space Modelscited by 499
  18. 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 471
  19. 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 407
  20. 2024Jamba: A Hybrid Transformer-Mamba Language Modelcited by 401
  21. 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 396
  22. 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 383
  23. 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 355
  24. 2021Random Feature Attentioncited by 354
  25. 2024Titans: Learning to Memorize at Test Timecited by 328
  26. 2024xLSTM: Extended Long Short-Term Memorycited by 327
  27. 2019Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernelcited by 213
  28. 2022cosFormer: Rethinking Softmax in Attentioncited by 213
  29. 2023Landmark Attention: Random-Access Infinite Context Length for Transformerscited by 213
  30. 2023LongNet: Scaling Transformers to 1,000,000,000 Tokenscited by 204
  31. 2025MoBA: Mixture of Block Attention for Long-Context LLMscited by 198
  32. 2022Transformer Quality in Linear Timecited by 191
  33. 2025MiniMax-01: Scaling Foundation Models with Lightning Attentioncited by 166
  34. 2024Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrencecited by 159
  35. 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 144
  36. 2025RWKV-7 "Goose" with Expressive Dynamic State Evolutioncited by 141
  37. 2025XAttention: Block Sparse Attention with Antidiagonal Scoringcited by 137
  38. 2024HGRN2: Gated Linear RNNs with State Expansioncited by 127

50 most cited of 73 All 73 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 8; 2026: 14.

22 papers.

Sort:

By area:

  1. 2025Kimi Linear: An Expressive, Efficient Attention Architecturecited by 196
  2. 2025Uni-cot: Towards Unified Chain-of-Thought Reasoning Across Text and Visioncited by 56
  3. 2025InfLLM-V2: Dense-Sparse Switchable Attention for Seamless Short-to-Long Adaptationcited by 32
  4. 2025FastMTP: Accelerating LLM Inference with Enhanced Multi-Token Predictioncited by 13
  5. 2025SSA: Sparse Sparse Attention by Aligning Full and Sparse Attention Outputs in Feature Spacecited by 6
  6. 2026Attention Needs to Focus: A Unified Perspective on Attention Allocationcited by 3
  7. 2025Towards Interpretable and Efficient Attention: Compressing All by Contracting a Fewcited by 2
  8. 2025RepetitionCurse: Measuring and Understanding Router Imbalance in Mixture-of-Experts LLMs under DoS Stresscited by 2
  9. 2026VecAttention: Vector-wise Sparse Attention for Accelerating Long Context Inferencecited by 2
  10. 2026VFA: Relieving Vector Operations in Flash Attention with Global Maximum Pre-computationcited by 2
  11. 2026KARA: Efficient Reasoning LLM Serving via Sliding-Window KV Cache Compressioncited by 2
  12. 2026SAS: Simple Attention Sparsification via End-to-End Optimization of Context Rankingcited by 2
10 more
  1. 2025Using Span Queries to Optimize for Cache and Attention Localitycited by 1
  2. 2026Manifold Random Featurescited by 1
  3. 2026DMAP: A Distribution Map for Textcited by 1
  4. 2026Diagonal-Tiled Mixed-Precision Attention for Efficient Low-Bit MXFP Inferencecited by 1
  5. 2026Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cachecited by 1
  6. 2026Towards a Data-Parameter Correspondence for LLMs: A Preliminary Discussioncited by 0
  7. 2026Token-Operations-Oriented Inference Optimization Techniques for Large Modelscited by 0
  8. 2026The Life of a Token: from Words to Bits on the Wirecited by 0
  9. 2026Approximating Softmax in Pretrained LLMs: Model Sensitivity and Kernel Accelerationcited by 0
  10. 2026HHR: Hierarchical Hash Retrieval for Efficient LLM Generationcited by 0