Skip to content
Preprint

AdaFlash: Adaptive Speculative Decoding via On-Policy Distilled Diffusion Drafters

Jul 2026 · 0 citations
Computer Science

TL;DR

AdaFlash framework is proposed, comprising two components: an on-policy distillation algorithm with reverse-KL divergence tailored for diffusion drafters, bringing stable convergence and effectively reducing domain-level variance and an adaptive length head that dynamically adjusts the candidate sequence length on the fly, substantially lowering the verification cost of the target model and handling token-level variance.

Abstract

Speculative decoding, in which a lightweight draft model first generates a draft sequence that is then verified in parallel by the target model, has become a prevalent paradigm for accelerating large language model inference. Recent work such as DFlash further boosts drafting efficiency by leveraging diffusion drafters, whose parallel denoising mechanism enables draft generation in a single forward pass. In this work, we uncover a central pitfall of diffusion drafters: bidirectional attention is a double-edged sword. On one hand, it endows the model with parallel generation and global contextual modeling capabilities; on the other hand, this inherent global dependency introduces high variance at both the domain-level and the token-level: acceptance rates fluctuate substantially across different domains, and draft token quality also varies heterogeneously at different token positions. To tackle this issue, we propose AdaFlash framework, comprising two components: (i) an on-policy distillation (OPD) algorithm with reverse-KL divergence tailored for diffusion drafters, bringing stable convergence and effectively reducing domain-level variance; and (ii) an adaptive length head that dynamically adjusts the candidate sequence length on the fly, substantially lowering the verification cost of the target model and handling token-level variance. Experiments demonstrate that AdaFlash consistently improves speedup rate during deployment, with especially significant gains in high-concurrency scenarios, achieving up to approximately 66% higher throughput than previous state-of-the-art methods.

View source

Similar papers

Preprint Aug 2026

xPress: Parallel Refinement for Diffusion Drafters in Speculative Decoding

Block-diffusion drafters like dFlash generate an entire block of draft tokens in a single forward pass, drastically reducing the overhead of multiple-token drafting in speculative decoding. The crucial final step of the single-pass discrete denoising process involves using the logit distribution at each position to sample conditionally independent tokens. The resulting draft is thus a set of per-position marginals, rather than a joint distribution: no draft token is guaranteed to depend on its predecessors. Such independently sampled marginals tend to produce sequences with tokens that are individually likely, but jointly improbable under the target model's distribution, which verifies each token conditionally. This can cause early rejection and limits acceptance length. To address this, we propose xPress as a means to restore the missing causality in diffusion drafters. xPress is a lightweight causal refiner that reconciles the whole diffusion block at once through parallel refinement, restoring and propagating causal dependencies across the draft without a token-by-token loop. On Qwen3-8B, across seven math, code, and chat benchmarks, xPress raises acceptance length by about 30% on average (up to +56%) and its end-to-end decoding throughput by about 1.3 on average (up to 1.7) compared to the original dFlash diffusion drafter.

Zheng Wang, Davis Wertheimer, Y. Lim et al. · 1 citation
Preprint Jul 2026

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting

Progressive Tree Drafting (PTD) is proposed, which employs a structured, guided parallel drafting strategy to harness the model's parallel potential by coupling a progressive tree structure with a stepwise pruning mechanism and actively guides the LLM to explore multiple semantic paths in a single forward pass.

Zipeng Gao, Zhi Zheng, Qingrong Xia et al. · 0 citations
Preprint Aug 2026

DBLAST: Dependent Block Drafting for Stochastic Speculative Decoding

This work proposes a dependent block drafter based on a low-rank latent mixture over token positions, complemented by an acceptance-oriented training objective that directly targets the expected verified length.

Amirmohammad Karimi, Chao Gao, Negar Hassanpour · 0 citations
Preprint Aug 2026

DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees

DARTree is introduced, a training-free speculative decoding method that extends a pretrained AR correction head from chains to trees, and achieves the highest average acceptance length and speedup in all four model--temperature configurations.

Tianyi Li, Yaxin Luo, Xinyi Shang et al. · 0 citations
Preprint Jul 2026

AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding

DFly is proposed, a block-diffusion framework combining a hybrid target-conditioning backbone with a predecessor-conditioned autoregressive head, improving target-feature utilization and intra-block dependency modeling while keeping generation parallel, and DFly treats verification as a shared batch-level resource.

Hong Liu, Rui Cen, Junhan Shi et al. · 1 citation
Review Aug 2026

Is Multimodal Speculative Decoding Ready for Diffusion-Based Parallel Drafting? A Survey and Empirical Diagnosis

A unified taxonomy that isolates drafter-side parallelism from orthogonal design choices such as tree construction and verification strategies is introduced, and a comprehensive empirical comparison of existing methods under varying degrees of parallelism across standardized multimodal benchmarks, including OCR, VQA, visual reasoning, and image captioning is provided.

Yantao Li, Huanlin Gao, Fang Zhao et al. · 0 citations