DC-Leap: Training-Free Acceleration of dLLMs via Draft-Guided Contiguous Leaping Decoding
> Paper: DC-Leap: Training-Free Acceleration of dLLMs via Draft-Guided Contiguous Leaping Decoding > Authors: Yanhua Jiao, Tianyi Wu, Xiaoxi Sun, Yulin Li, HuiLing Zhen, Libo Qin, Baotian Hu, Zhuotao Tian, Min Zhang (Harbin Institute of Technology, Shenzhen; Huawei Noah's Ark Lab) > arXiv: 2607.20467 | Venue: ICML 2026 > Code: https://github.com/ffh-wyls/DC-Leap
Key points
- Background: Diffusion LLMs (dLLMs) generate text by starting from a fully masked sequence and progressively denoising it, enabling globally informed generation unlike the strictly left-to-right generation of autoregressive models (GPT-style). However, each denoising round requires a full forward pass over the entire sequence, making generation slow.
- The problem with naive parallel decoding: Accepting many tokens per round introduces *JPDE* (Joint Probability Dependence Error) — predictions for later tokens may rely on earlier tokens that are not yet finalized. Existing methods counter this with high confidence thresholds, which severely limits per-round acceptance.
- Mechanism 1 — Dynamic Contiguous Verification (DCV): Candidate tokens are verified in a strict left-to-right causal chain: each token is validated conditioned on the decoded prefix plus the previously verified tokens in the window. This cascade preserves causal consistency, so moderately confident tokens can be safely accepted without causing JPDE.
- Mechanism 2 — Draft-Guided Decoding: A fast draft of future tokens is generated beyond the current window, providing forward-looking context. Draft tokens act as "semantic anchors"; even a partially accurate draft improves decoding decisions in the current window.
- Training-free: DC-Leap works purely at inference time — no weight modifications, no extra training data — and is plug-and-play with existing dLLMs (validated on LLaDA and Dream).
- Models tested: LLaDA-8B-Instruct, LLaDA-1.5, Dream-v0-7B-Instruct
- Benchmarks: MBPP (long-sequence code generation), GSM8K, HumanEval, and others
- Speedups:
- DC-Leap on MBPP (1024 tokens): 53.19x
- DC-Leap + KV-Cache: 105.02x
- Findings:
Results
Why it matters
Diffusion LLMs offer theoretical advantages over autoregressive models — full bidirectional context, iterative refinement, and better controllability — but inference speed has been the main barrier to practical use. By delivering order-of-magnitude speedups at zero training cost, DC-Leap moves dLLMs significantly closer to production deployment.
References
1. Jiao, Y., Wu, T., Sun, X., et al. (2026). *DC-Leap: Training-Free Acceleration of dLLMs via Draft-Guided Contiguous Leaping Decoding*. arXiv:2607.20467. ICML 2026. 2. Nie, S., et al. (2025). Large Language Diffusion Models. *ICLR*. 3. Kong, X., et al. (2025). LocalLeap: Accelerating dLLMs via Locality-Aware Parallel Decoding. 4. Ma, X., et al. (2025). dLLM-Cache: Efficient Key-Value Cache for Diffusion Language Models. 5. Chen, Y., et al. (2026). STDec: Spatio-Temporal Stability Guided Decoding for dLLMs. arXiv:2604.06330.