mlsanityData to 7 Oct 2026

Draft Model Knows When to Stop: Self-Verification Speculative Decoding for Long-Form Generation

arXiv 2411.18462 ↗First posted 27 Nov 2024cs.CL cs.AIcited by 15

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

Abstract (arXiv)

Conventional speculative decoding (SD) methods utilize a predefined length policy for proposing drafts, which implies the premise that the target model smoothly accepts the proposed draft tokens. However, reality deviates from this assumption: the oracle draft length varies significantly, and the fixed-length policy hardly satisfies such a requirement. Moreover, such discrepancy is further exacerbated in scenarios involving complex reasoning and long-form generation, particularly under test-time scaling for reasoning-specialized models. Through both theoretical and empirical estimation, we establish that the discrepancy between the draft and target models can be approximated by the draft model's prediction entropy: a high entropy indicates a low acceptance rate of draft tokens, and vice versa. Based on this insight, we propose SVIP: Self-Verification Length Policy for Long-Context Speculative Decoding, which is a training-free dynamic length policy for speculative decoding systems that adaptively determines the lengths of draft sequences by referring to the draft entropy. Experimental results on mainstream SD benchmarks as well as reasoning-heavy benchmarks demonstrate the superior performance of SVIP, achieving up to 17% speedup on MT-Bench at 8K context compared with fixed draft lengths, and 22% speedup for QwQ in long-form reasoning.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 20 of its 26 references that are in the map. First posted on arXiv 27 Nov 2024.

Builds on

20 of 26 references.

Closest ancestors · 14

Same direction, newest first

  1. 2024A Theoretical Perspective for Speculative Decoding Algorithm30 Oct
  2. 2024QSpec: Speculative Decoding with Complementary Quantization Schemes15 Oct
  3. 2024Temperature-Centric Investigation of Speculative Decoding with Knowledge Distillation14 Oct
  4. 2024Dynamic Depth Decoding: Faster Speculative Decoding for LLMs30 Aug
  5. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  6. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  7. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths30 May
  8. 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding3 Feb
  9. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  10. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  11. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  12. 2023PaSS: Parallel Speculative Sampling22 Nov
2 more
  1. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  2. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 6

  1. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  2. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  3. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  4. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  5. 2024Scaling Synthetic Data Creation with 1,000,000,000 Personascited by 397
  6. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 12.

15 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2026LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter
  2. 2025SpecPV: Improving Self-Speculative Decoding for Long-Context Generation via Partial Verification
  3. 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding
  4. 2025Draft, Verify, and Improve: Toward Training-Aware Speculative Decoding
  5. 2024AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability
  6. 2025Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match
  7. 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
  8. 2026From Tokens to Steps: Verification-Aware Speculative Decoding for Efficient Multi-Step Reasoning