SpecExtend: A Drop-in Enhancement for Speculative Decoding of Long Sequences
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Speculative decoding is a widely used technique for accelerating inference in large language models (LLMs), but its performance degrades as input length grows, with significant drops even at moderate lengths. Yet, this early degradation has remained largely underexplored. We introduce SpecExtend, a drop-in enhancement that improves speculative decoding on long sequences without additional training. SpecExtend integrates efficient attention mechanisms such as FlashAttention and Hybrid Tree Attention to accelerate prefill and verification steps. To improve both draft accuracy and speed on long inputs without retraining, we propose Cross-model Retrieval, a novel KV cache eviction strategy that leverages the target model's attention scores to dynamically select relevant context for the smaller draft model. Extensive evaluations show that SpecExtend accelerates speculative decoding by up to 2.84x on 16K-token long document summarization and up to 3.86x on long-form reasoning, while preserving the short-input performance of state-of-the-art frameworks. Our code is available at https://github.com/jycha98/SpecExtend .
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 23 of its 36 references that are in the map. First posted on arXiv 27 May 2025.
Builds on
23 of 36 references.
Closest ancestors · 13
Same direction, newest first
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
- 2024MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding20 Aug
- 2024OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure25 Jun
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
- 2024TriForce: Lossless Acceleration of Long Sequence Generation with Hierarchical Speculative Decoding18 Apr
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
- 2024Multi-Candidate Speculative Decoding12 Jan
- 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
1 more
Other references · 10
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2023Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation in Natural Language Generationcited by 819
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 726
- 2021Efficient Attentions for Long Document Summarizationcited by 345
- 2019Analyzing the Structure of Attention in a Transformer Language Modelcited by 243
- 2021BookSum: A Collection of Datasets for Long-form Narrative Summarizationcited by 184
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Vegas: Self-Speculative Decoding with Verification-Guided Sparse Attentioncited by 7
- 2026KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problemcited by 5
- 2026ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inferencecited by 1
- 2026Windowed-MTP: Removing the Full-Context Draft-KV Tax at Million-Token Contextcited by 0
- 2026FOLD: Position-Free Far Memory with Local Order for Long-Context Speculative Decodingcited by 0
- 2026FOLD: Position-Free Far Memory with Local Order for Long-Context Speculative Decoding14 Oct 2026
- 2026ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference16 Sep 2026
- 2026Windowed-MTP: Removing the Full-Context Draft-KV Tax at Million-Token Context23 Jul 2026
- 2026KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem23 Feb 2026
- 2026Vegas: Self-Speculative Decoding with Verification-Guided Sparse Attention6 Feb 2026
Similar, not cited
Close in wording, no citation either way
- 2025RAPID: Long-Context Inference with Retrieval-Augmented Speculative Decoding
- 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
- 2025Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling
- 2026A Sparse Glimpse of the Whole: Train-Free Self-Speculative Decoding
- 2025Speculative Decoding: Performance or Illusion?
- 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths
- 2026Speculative Decoding with a Speculative Vocabulary
- 2026RACER: Retrieval-Augmented Contextual Rapid Speculative Decoding