mlsanityData to 7 Oct 2026

DEdit: Iterative Draft Editing for Speculative Decoding

arXiv 2609.38510 ↗First posted 29 Sep 2026cs.CLcited by 0

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

Abstract (arXiv)

Speculative decoding accelerates autoregressive LLMs by having a lightweight drafter propose tokens that the target model verifies in parallel. Diffusion-based drafters further reduce drafting latency by proposing multiple tokens at once. However, these tokens are predicted independently, so a single early error causes prefix verification to discard the rest of the draft, even when it contains useful downstream predictions. We introduce DEdit, a diffusion-based drafter that can not only draft by conventional parallel unmasking but also iteratively edit its draft through token-to-token predictions. Through editing, later predictions can serve as bidirectional context for repairing earlier errors and extending the accepted prefix. To teach the model to repair errors while preserving correct predictions, we propose ProposalMix, a training scheme that mixes draft predictions with ground-truth tokens based on first-pass confidence during training. Across seven benchmarks on Qwen3-4B and Qwen3-8B, DEdit achieves the highest macro-average token acceptance and speedup among the evaluated drafters, reaching macro-average speedups of 5.72× and 5.97× over autoregressive generation under greedy decoding, respectively. Further analysis shows that acceptance improves with more editing passes and wider drafting windows, and that ProposalMix halves harmful edits that shorten the accepted prefix. Moreover, restricting the editor to causal attention lowers acceptance, especially on highly predictable outputs, indicating that future context is a key source of these gains.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 35 of its 42 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

35 of 42 references.

Closest ancestors · 22

Same direction, newest first

  1. 2026Verification-Aware Training for Speculative Decoding31 Aug
  2. 2026LiLiCorr: Lightweight Likelihood Correlation of Parallel Drafts for Speculative Decoding20 Aug
  3. 2026DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees13 Aug
  4. 2026xPress: Parallel Refinement for Diffusion Drafters in Speculative Decoding3 Aug
  5. 2026DeLS-Spec: Decoupled Long-Short Contexts for Parallel Speculative Drafting8 Jul
  6. 2026DSpark: Confidence-Scheduled Speculative Decoding with Semi-Autoregressive Generation6 Jul
  7. 2026JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting16 Jun
  8. 2026DFlare: Scaling Up Draft Capacity for Block Diffusion Speculative Decoding1 Jun
  9. 2026Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding28 May
  10. 2026PARD-2: Target-Aligned Parallel Draft Model for Dual-Mode Speculative Decoding9 May
  11. 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
  12. 2025DEER: Draft with Diffusion, Verify with Autoregressive Models17 Dec
10 more
  1. 2025SpecDiff-2: Scaling Diffusion Drafter Alignment For Faster Speculative Decoding1 Nov
  2. 2025DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding28 Sep
  3. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  4. 2024Speculative Diffusion Decoding: Accelerating Language Generation through Diffusion10 Aug
  5. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  6. 2024Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding7 Feb
  7. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  8. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  9. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  10. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 13

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  3. 2025Qwen3 Technical Reportcited by 8,195
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  5. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  6. 2023Let's Verify Step by Stepcited by 3,598
  7. 2021Program Synthesis with Large Language Modelscited by 3,509
  8. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
  9. 2024Better & Faster Large Language Models via Multi-token Predictioncited by 344
  10. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  11. 2026LLaDA2.1: Speeding Up Text Diffusion via Token Editingcited by 48
  12. 2026DMax: Aggressive Parallel Decoding for dLLMscited by 14
1 more
  1. 2026Speculative Correction: Draft-then-Refine Decoding for Diffusion Language Modelscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
  2. 2025FastEagle: Cascaded Drafting for Accelerating Speculative Decoding
  3. 2026D^2SD: Accelerating Speculative Decoding with Dual Diffusion Draft Models
  4. 2026Carryover Drafting: Recycling Rejected States for Speculative Decoding
  5. 2026LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter
  6. 2026Accepted Prefixes Are Not All You Need: A Negative Result on PEFT-Based Block-Diffusion Drafting
  7. 2026TAPS: Task Aware Proposal Distributions for Speculative Sampling
  8. 2026Make Every Draft Count: Hidden State based Speculative Decoding