mlsanityData to 7 Oct 2026

SpecAttn: Speculating Sparse Attention

arXiv 2510.27641 ↗First posted 31 Oct 2025cs.CL cs.LG cs.SYcited by 1

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Large Language Models (LLMs) face significant computational bottlenecks during inference due to the quadratic complexity of self-attention mechanisms, particularly as context lengths increase. We introduce SpecAttn, a novel training-free approach that seamlessly integrates with existing speculative decoding techniques to enable efficient sparse attention in pre-trained transformers. Our key insight is to exploit the attention weights already computed by the draft model during speculative decoding to identify important tokens for the target model, eliminating redundant computation while maintaining output quality. SpecAttn employs three core techniques: KL divergence-based layer alignment between draft and target models, a GPU-optimized sorting-free algorithm for top-p token selection from draft attention patterns, and dynamic key-value cache pruning guided by these predictions. By leveraging the computational work already performed in standard speculative decoding pipelines, SpecAttn achieves over 75% reduction in key-value cache accesses with a mere 15.29% increase in perplexity on the PG-19 dataset, significantly outperforming existing sparse attention methods. Our approach demonstrates that speculative execution can be enhanced to provide approximate verification without significant performance degradation.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 16 of its 18 references that are in the map. First posted on arXiv 31 Oct 2025.

Builds on

16 of 18 references.

Closest ancestors · 2

Same direction, newest first

  1. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  2. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 14

  1. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  2. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  3. 2020Longformer: The Long-Document Transformercited by 3,362
  4. 2016Pointer Sentinel Mixture Modelscited by 2,992
  5. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  6. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  7. 2020Big Bird: Transformers for Longer Sequencescited by 1,673
  8. 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,378
  9. 2019Compressive Transformers for Long-Range Sequence Modellingcited by 699
  10. 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 507
  11. 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 487
  12. 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
2 more
  1. 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Servingcited by 248
  2. 2025Twilight: Adaptive Attention Sparsity with Hierarchical Top-p Pruningcited by 48

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026A Sparse Glimpse of the Whole: Train-Free Self-Speculative Decoding
  2. 2026STS: Efficient Sparse Attention with Speculative Token Sparsity
  3. 2025SpecExtend: A Drop-in Enhancement for Speculative Decoding of Long Sequences
  4. 2026Vegas: Self-Speculative Decoding with Verification-Guided Sparse Attention
  5. 2026Elastic Threshold Attention: Learned Contextual Sparsity for Long-Context Decoding
  6. 2025Cross-Attention Speculative Decoding
  7. 2025Accelerating Large-Scale Reasoning Model Inference with Sparse Self-Speculative Decoding
  8. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths