Teaching Diffusion to Speculate Left-to-Right
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) achieve remarkable performance across a wide range of tasks, but their autoregressive decoding process incurs substantial inference costs due to inherently sequential token generation. Speculative decoding addresses this bottleneck by employing a lightweight draft model to propose multiple future tokens that are subsequently verified in parallel by a larger target model. Recent work has demonstrated that diffusion language models are well suited for this setting, as they can generate entire blocks of draft tokens in parallel and thereby alleviate the sequential constraints of autoregressive drafting. A subtlety of this regime is that block-diffusion drafters generate tokens bidirectionally within a block, whereas verification is performed by an autoregressive target model that evaluates tokens in a strictly left-to-right manner, leaving a gap between the symmetric training-time objective and the asymmetric verification-time reward. In this work, we offer an empirical analysis of three training-time interventions that narrow this gap: token positional weighting, a first-error focal loss that targets the position that breaks the accepted prefix within each block, and a chain loss term that substitutes a differentiable surrogate for the expected accepted length. The three interventions act along orthogonal axes (position, block-conditional first error, joint prefix) and compose additively; they are likewise orthogonal to test-time alignment mechanisms such as multi-draft self-selection, with which they can in principle be combined. Across four target models and six reasoning, code, and dialogue benchmarks, the three interventions raise accepted draft length by 21-76% per benchmark over a position-uniform baseline, without adding additional forward passes and without changing the inference pipeline or the rejection-sampling exactness contract.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 34 of its 55 references that are in the map. First posted on arXiv 10 Jun 2026.
Builds on
34 of 55 references.
References · 34
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
- 2025Qwen3 Technical Reportcited by 8,195
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2023Code Llama: Open Foundation Models for Codecited by 2,105
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
22 more
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
- 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 975
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 821
- 2023Discrete Diffusion Modeling by Estimating the Ratios of the Data Distributioncited by 712
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 564
- 2017Non-Autoregressive Neural Machine Translationcited by 457
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Treescited by 362
- 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Testcited by 318
- 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decodingcited by 295
- 2018Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinementcited by 194
- 2023SARATHI: Efficient LLM Inference by Piggybacking Decodes with Chunked Prefillscited by 187
- 2026DFlash: Block Diffusion for Flash Speculative Decodingcited by 120
- 2024Hydra: Sequentially-Dependent Draft Heads for Medusa Decodingcited by 113
- 2021Step-unrolled Denoising Autoencoders for Text Generationcited by 102
- 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decodingcited by 74
- 2024Learning Harmonized Representations for Speculative Samplingcited by 69
- 2024Kangaroo: Lossless Self-Speculative Decoding via Double Early Exitingcited by 58
- 2026Accelerating Speculative Decoding with Block Diffusion Draft Treescited by 27
- 2025SpecDiff-2: Scaling Diffusion Drafter Alignment For Faster Speculative Decodingcited by 26
- 2026LK Losses: Direct Acceptance Rate Optimization for Speculative Decodingcited by 17
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Spec-AUF: Accept-Until-Fail Training under Train-Inference Misalignment for Masked Block Drafterscited by 3
- 2026Ceiling-Clipped Acceptance Histograms Indicate Stranded Speed-up in Block-Diffusion Speculative Decodingcited by 0
- 2026Diffusion Drafts, AR Verifies: Accelerating Document OCR with Self-Speculative Decodingcited by 0
- 2026Diffusion Drafts, AR Verifies: Accelerating Document OCR with Self-Speculative Decoding22 Sep 2026
- 2026Ceiling-Clipped Acceptance Histograms Indicate Stranded Speed-up in Block-Diffusion Speculative Decoding31 Aug 2026
- 2026Spec-AUF: Accept-Until-Fail Training under Train-Inference Misalignment for Masked Block Drafters2 Jul 2026
Similar, not cited
Close in wording, no citation either way
- 2026SimSD: Simple Speculative Decoding in Diffusion Language Models
- 2025DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding
- 2026PRESTO: Prefix-Aligned Tree Drafting for Diffusion Speculative Decoding
- 2026Speculative Correction: Draft-then-Refine Decoding for Diffusion Language Models
- 2026D^2SD: Accelerating Speculative Decoding with Dual Diffusion Draft Models
- 2026LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter
- 2026Accepted Prefixes Are Not All You Need: A Negative Result on PEFT-Based Block-Diffusion Drafting
- 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs