Reciprocal Guidance: Orchestrating Draft and Verify Budgets for Advancing the Diffusion-AR Self-Speculation Frontier
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Diffusion drafting with autoregressive (AR) verification has emerged as a promising paradigm for efficient speculative decoding. Recent self-speculation models, represented by Nemotron-Labs-Diffusion, further simplify the speculative pipeline by unifying drafting and verification within a shared backbone, while enabling longer acceptance lengths. However, the Pareto frontier between aggregate and per-request throughput remains underexplored. At low concurrency, sequential draft-verify execution requires two model forward passes per round, limiting the effective tokens per forward (TPF). By contrast, at high concurrency, longer drafts incur increasingly expensive computation, forcing individual requests to operate under constrained speculation budgets and preventing full exploitation of the full-backbone drafter. Our key observation indicates that drafting and verification exhibit reciprocal predictability. Draft logits can anticipate likely verification mismatches, while recent verification outcomes predict future drafting utility and suitable block sizes. Building on this observation, we introduce Reciprocal Guidance (RecGuide), a runtime draft-verify orchestration framework that adapts speculative decoding to varying serving loads. RecGuide exploits spare compute capacity through verification-overlapped drafting at low concurrency, while dynamically allocating request-specific draft block sizes as the workload becomes increasingly compute-intensive. Experiments across a wide range of concurrency levels demonstrate consistent throughput improvements over vanilla self-speculation, achieving up to 1.8× speedup.
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 39 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
36 of 39 references.
Closest ancestors · 21
Same direction, newest first
- 2026DFlow: Enabling Verifier Information Flow in Block Diffusion Speculative Decoding6 Sep
- 2026ReTrace: Rejected-Trajectory Conditioning for Speculative Decoding30 Aug
- 2026AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding28 Jul
- 2026D-cut: Adaptive Verification Depth Pruning for Batched Speculative Decoding16 Jul
- 2026DSpark: Confidence-Scheduled Speculative Decoding with Semi-Autoregressive Generation6 Jul
- 2026Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding28 May
- 2026FlexDraft: Flexible Speculative Decoding via Attention Tuning and Bonus-Guided Calibration19 May
- 2026SpecForge: A Flexible and Efficient Open-Source Training Framework for Speculative Decoding19 Mar
- 2026Learning to Draft: Adaptive Speculative Decoding with Reinforcement Learning2 Mar
- 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
- 2025CAS-Spec: Cascade Adaptive Self-Speculative Decoding for On-the-Fly Lossless Inference Acceleration of LLMs30 Oct
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
9 more
- 2024MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding20 Aug
- 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
- 2024ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding21 Feb
- 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
Other references · 15
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2023Let's Verify Step by Stepcited by 3,789
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
- 2025Large Language Diffusion Modelscited by 912
- 2025Dream 7B: Diffusion Large Language Modelscited by 544
- 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Servingcited by 258
- 2025SDAR: A Synergistic Diffusion-AutoRegression Paradigm for Scalable Sequence Generationcited by 129
3 more
- 2025TiDAR: Think in Diffusion, Talk in Autoregressioncited by 37
- 2026Nemotron-Labs-Diffusion: A Tri-Mode Language Model Unifying Autoregressive, Diffusion, and Self-Speculation Decodingcited by 24
- 2026Do Less, Achieve More: Do We Need Every-Step Optimization for RL Fine-tuning of Diffusion Models?cited by 6
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025FastEagle: Cascaded Drafting for Accelerating Speculative Decoding
- 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
- 2026When Parallel Drafter Meets Parallel Speculative Decoding
- 2026TAPS: Target-Aware Prefix Tree Selection for Diffusion-Drafted Speculative Decoding
- 2026Accelerating Speculative Diffusions via Block Verification
- 2026Bastion: Budget-Aware Speculative Decoding with Tree-structured Block Diffusion Drafting
- 2026DEdit: Iterative Draft Editing for Speculative Decoding
- 2026BV Loss: Block Verification-Aware Loss for Block Diffusion Speculative Decoding