Accelerating Prefilling for Long-Context LLMs via Sparse Pattern Sharing
Not on the map. Why?
Abstract (arXiv)
Sparse attention methods exploit the inherent sparsity in attention to speed up the prefilling phase of long-context inference, mitigating the quadratic complexity of full attention computation. While existing sparse attention methods rely on predefined patterns or inaccurate estimations to approximate attention behavior, they often fail to fully capture the true dynamics of attention, resulting in reduced efficiency and compromised accuracy. Instead, we propose a highly accurate sparse attention mechanism that shares similar yet precise attention patterns across heads, enabling a more realistic capture of the dynamic behavior of attention. Our approach is grounded in two key observations: (1) attention patterns demonstrate strong inter-head similarity, and (2) this similarity remains remarkably consistent across diverse inputs. By strategically sharing computed accurate patterns across attention heads, our method effectively captures actual patterns while requiring full attention computation for only a small subset of heads. Comprehensive evaluations demonstrate that our approach achieves superior or comparable speedup relative to state-of-the-art methods while delivering the best overall accuracy.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 9 of its 14 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
9 of 14 references.
References · 9
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 726
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 383
- 2024∞Bench: Extending Long Context Evaluation Beyond 100K Tokenscited by 367
- 2025Multi-agent Architecture Search via Agentic Supernetcited by 179
- 2023Knowledge Graph Prompting for Multi-Document Question Answeringcited by 152
- 2023CodePlan: Repository-level Coding using LLMs and Planningcited by 140
- 2023Chain-of-Thought Hub: A Continuous Effort to Measure Large Language Models' Reasoning Performancecited by 102
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025ProxyAttn: Guided Sparse Attention via Representative Headscited by 9
- 2026Elastic Attention: Test-time Adaptive Sparsity Ratios for Efficient Transformerscited by 5
- 2026EchoKV: Efficient KV Cache Compression via Similarity-Based Reconstructioncited by 4
- 2026Flux Attention: Context-Aware Hybrid Attention for Efficient LLMs Inferencecited by 0
- 2026Flux Attention: Context-Aware Hybrid Attention for Efficient LLMs Inference8 Apr 2026
- 2026EchoKV: Efficient KV Cache Compression via Similarity-Based Reconstruction24 Mar 2026
- 2026Elastic Attention: Test-time Adaptive Sparsity Ratios for Efficient Transformers24 Jan 2026
- 2025ProxyAttn: Guided Sparse Attention via Representative Heads29 Sep 2025