mlsanityData to 14 Oct 2026

Beyond the Target: From Imitation to Collaboration in Speculative Decoding

arXiv 2605.24793 ↗First posted 24 May 2026cs.CLcited by 2

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

Abstract (arXiv)

Speculative decoding (SPD) accelerates large language model (LLM) inference by letting a smaller draft model propose multiple future tokens that are verified in parallel by a larger target model. The dominant SPD paradigm treats the target model as the sole reliable teacher, accepting a draft token only when it exactly matches the target prediction. This design implicitly assumes that the target is always the better choice at every position. In practice, this assumption does not hold. Although the draft is the weaker model overall, it is not uniformly inferior at the token level. In a meaningful fraction of cases where draft and target disagree, the draft's choice is the one that leads to the correct final answer. Inspired by this, we introduce Collaborative Speculative Decoding (CoSpec), a generalization of SPD that no longer treats the target model as the sole token-level authority. CoSpec trains an arbitration policy via reinforcement learning to decide whether to accept tokens from the draft or target model, selectively accepting draft tokens at mismatches when doing so is likely to yield a correct final answer. Experimental results show that CoSpec maintains substantial speedups while surpassing target-only performance. By shifting the emphasis from imitation to collaboration, CoSpec suggests a new perspective on speculative decoding.

Key facts. Cited by 2 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 36 of its 38 references that are in the map. First posted on arXiv 24 May 2026.

Builds on

36 of 38 references.

Closest ancestors · 20

Same direction, newest first

  1. 2025Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match28 Nov
  2. 2025Reject Only Critical Tokens: Pivot-Aware Speculative Decoding1 Nov
  3. 2025SelfJudge: Faster Speculative Decoding via Self-Supervised Judge Verification26 Sep
  4. 2025Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding24 May
  5. 2025Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification19 May
  6. 2025RASD: Retrieval-Augmented Speculative Decoding5 Mar
  7. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  8. 2025Fuzzy Speculative Decoding for a Tunable Accuracy-Runtime Tradeoff28 Feb
  9. 2025Speeding up Speculative Decoding via Sequential Approximate Verification6 Feb
  10. 2025Reward-Guided Speculative Decoding for Efficient LLM Reasoning31 Jan
  11. 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
  12. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
8 more
  1. 2024Faster Cascades via Speculative Decoding29 May
  2. 2024Block Verification Accelerates Speculative Decoding15 Mar
  3. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  4. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  5. 2023Cascade Speculative Drafting for Even Faster LLM Inference18 Dec
  6. 2023REST: Retrieval-Based Speculative Decoding14 Nov
  7. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  8. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 16

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2025Qwen3 Technical Reportcited by 8,820
  4. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  6. 2023Let's Verify Step by Stepcited by 3,789
  7. 2021Program Synthesis with Large Language Modelscited by 3,637
  8. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  9. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  10. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 853
  11. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 682
  12. 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 564
4 more
  1. 2022Language Models are Multilingual Chain-of-Thought Reasonerscited by 530
  2. 2024Mixture-of-Agents Enhances Large Language Model Capabilitiescited by 438
  3. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 372
  4. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Fast Large Language Model Collaborative Decoding via Speculation
  2. 2025Speculative Decoding: Performance or Illusion?
  3. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding
  4. 2024Decoding Speculative Decoding
  5. 2025Speculate, then Collaborate: Fusing Knowledge of Language Models during Decoding
  6. 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
  7. 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
  8. 2025Draft, Verify, and Improve: Toward Training-Aware Speculative Decoding