mlsanityData to 14 Oct 2026

Reject Only Critical Tokens: Pivot-Aware Speculative Decoding

arXiv 2511.00351 ↗First posted 1 Nov 2025cs.LG cs.CLcited by 4

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

Abstract (arXiv)

Speculative Decoding (SD) ensures that the output matches the target model's distribution exactly. However, we argue that this distribution matching requirement is too stringent and results in unnecessarily low acceptance rates, limiting potential speedups. Instead, we advocate a reformulation of the decoding objective: the proposed decoding strategy should match the expected utility, i.e., the task-specific performance, of the target model. This perspective also aligns better with real-world use cases of LLMs, where utility (e.g., code correctness, factual accuracy) is often more important than sampling distribution. Based on this reformulation, we propose a novel decoding strategy: Pivot-Aware Speculative Decoding, which rejects only those tokens that would lead to a utility drop in the final output. We refer to these critical tokens as pivot tokens. We propose a method for labeling tokens as pivotal or non-pivotal and train a lightweight classifier to detect them. This method can be viewed as a relaxed version of standard SD, which offers much higher acceptance while preserving utility. We evaluate our method across various datasets, demonstrating that we can achieve up to 2.5× speedup with comparable utility. Source code is available at https://github.com/amir-zsh/PAD.

Key facts. Cited by 4 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 17 of its 22 references that are in the map. First posted on arXiv 1 Nov 2025.

Builds on

17 of 22 references.

Closest ancestors · 14

Same direction, newest first

  1. 2025Scaling Speculative Decoding with Lookahead Reasoning24 Jun
  2. 2025SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning10 Apr
  3. 2025Reward-Guided Speculative Decoding for Efficient LLM Reasoning31 Jan
  4. 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
  5. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  6. 2024Ouroboros: Generating Longer Drafts Phrase by Phrase for Faster Speculative Decoding21 Feb
  7. 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding3 Feb
  8. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  9. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  10. 2023Cascade Speculative Drafting for Even Faster LLM Inference18 Dec
  11. 2023REST: Retrieval-Based Speculative Decoding14 Nov
  12. 2023Speculative Decoding with Big Little Decoder15 Feb
2 more
  1. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  2. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 3

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2025Qwen3 Technical Reportcited by 8,820
  3. 2021Program Synthesis with Large Language Modelscited by 3,637

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding
  2. 2025Speculative Decoding: Performance or Illusion?
  3. 2026A Practical Investigation of Training-free Relaxed Speculative Decoding
  4. 2024Decoding Speculative Decoding
  5. 20253-Model Speculative Decoding
  6. 2025Tutorial Proposal: Speculative Decoding for Efficient LLM Inference
  7. 2026Speculative Speculative Decoding
  8. 2025GRIFFIN: Effective Token Alignment for Faster Speculative Decoding