mlsanityData to 14 Oct 2026

Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing

arXiv 2605.14978 ↗First posted 14 May 2026cs.CLcited by 0

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

Abstract (arXiv)

Speculative decoding accelerates LLM inference by having a lightweight draft model propose speculative windows of candidate tokens for parallel verification by a larger target model. In practice, speculative efficiency is often bottlenecked by hard-to-draft positions, where an early mismatch truncates the accepted prefix and invalidates the rest of the speculative window. Most learning-based drafters are still optimized with token-level supervised objectives, even though speculative utility is inherently window-level and prefix-sensitive. We propose PPOW (Performance-Driven Policy Optimization with Adaptive Windowing), a reinforcement learning framework that shifts drafter optimization from token-level imitation to window-level optimization. PPOW combines a Cost-Aware Speedup Reward, a Distribution-Based Proximity Reward, and Adaptive Divergence-Aware Windowing, which prioritizes informative windows with high confidence-weighted draft-target divergence. PPOW achieves average acceptance lengths of 6.29-6.52 and speedups of 3.39-4.36× across multiple model families and benchmarks under a unified decoding protocol. These results show that performance-driven window-level optimization is a practical approach to improving speculative decoding efficiency.

Key facts. No citing papers in the map yet (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 14 May 2026.

Builds on

36 of 38 references.

Closest ancestors · 24

Same direction, newest first

  1. 2025RLHFSpec: Breaking the Efficiency Bottleneck in RLHF Training via Adaptive Drafting4 Dec
  2. 2025ReSpec: Towards Optimizing Speculative Decoding in Reinforcement Learning Systems30 Oct
  3. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  4. 2025GRIFFIN: Effective Token Alignment for Faster Speculative Decoding16 Feb
  5. 2025Reward-Guided Speculative Decoding for Efficient LLM Reasoning31 Jan
  6. 2024FastDraft: How to Train Your Draft17 Nov
  7. 2024Learning Harmonized Representations for Speculative Sampling28 Aug
  8. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  9. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  10. 2024SpecExec: Massively Parallel Speculative Decoding for Interactive LLM Inference on Consumer Devices4 Jun
  11. 2024Dynamic Speculation Lookahead Accelerates Speculative Decoding of Large Language Models7 May
  12. 2024Block Verification Accelerates Speculative Decoding15 Mar
12 more
  1. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
  2. 2024Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding7 Feb
  3. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  4. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  5. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  6. 2023Cascade Speculative Drafting for Even Faster LLM Inference18 Dec
  7. 2023SpecTr: Fast Speculative Decoding via Optimal Transport23 Oct
  8. 2023DistillSpec: Improving Speculative Decoding via Knowledge Distillation12 Oct
  9. 2023Online Speculative Decoding11 Oct
  10. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  11. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  12. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 12

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  5. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  6. 2025Qwen3 Technical Reportcited by 8,820
  7. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  8. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  9. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,317
  10. 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 839
  11. 2023PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallelcited by 660
  12. 2024Adaptive Draft-Verification for Efficient Large Language Model Decodingcited by 9

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Learning to Draft: Adaptive Speculative Decoding with Reinforcement Learning
  2. 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding
  3. 2026Acceptance-Aware Draft Model Training for Speculative Decoding
  4. 2025TapOut: A Bandit-Based Approach to Dynamic Speculative Decoding
  5. 2026SpecKV: Adaptive Speculative Decoding with Compression-Aware Gamma Selection
  6. 2026Carryover Drafting: Recycling Rejected States for Speculative Decoding
  7. 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
  8. 2025Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding