Why acceptance rate beats raw latency for block diffusion decoding
The whole point of speculative decoding is that the target model verifies a block of draft tokens in parallel. If the draft tokens are wrong, the target rejects them and you've wasted the parallel verification pass. So the metric that actually drives speedup is the acceptance rate — the fraction of drafted tokens the target model accepts. DFlash reports over 6x lossless acceleration, and the key is that its block diffusion draft model produces high-quality outputs that the target accepts, not that the draft model is fast in isolation [3]. A latency test that only measures the draft model's generation time would miss this entirely.
DFlare pushes this further by showing that draft capacity — how expressive the draft model is — directly improves acceptance. By giving each draft layer its own learnable combination of target layers (instead of a single fused representation), DFlare scales the draft model deeper and achieves 5.52x average wall-clock speedup on Qwen3-4B, 5.46x on Qwen3-8B, and 3.91x on GPT-OSS-20B, improving over DFlash by 11%, 8%, and 5% respectively [1]. Those percentage gains are exactly the kind of improvement that a pure latency benchmark would hide, because they come from better draft quality, not faster generation.
Throughput and test-time scaling: the metrics that matter for real deployment
In production, you care about how many requests you can serve per second, not just how fast one request completes. Fast-dDrive, a block-diffusion VLA for autonomous driving, reports a 12x throughput speedup over an autoregressive baseline when integrated with SGLang [2]. That's a deployment-level metric that accounts for batching, memory bandwidth, and parallel verification — things a single-block latency test ignores. For edge hardware, memory-bandwidth-bound autoregressive models are the bottleneck, and block diffusion's parallel drafting directly addresses that [2].
Test-time scaling is another deployment metric that matters more than latency. Fast-dDrive introduces a low-overhead scheme: fork N stochastic trajectory rollouts from a single shared-prefix KV cache and average them, suppressing prediction variance at fractional cost [2]. This is a way to improve output quality without sacrificing throughput — a trade-off that a latency test can't capture. Similarly, DDTree constructs a draft tree from the draft model's per-position distributions, selecting the most likely continuations under a fixed node budget, and verifies the whole tree in one target forward pass [4]. The metric that matters here is the expected acceptance length per verification pass, not the time to generate a single block.
About These Sources
This answer is built on 4 studies (all preprints) — published in 2026, 4 from 2024 or later — selected as the most relevant from 4 studies that passed quality screening, drawn from 26 papers retrieved from a database of over 500 million.
Sources used in this answer
DFlare: Scaling Up Draft Capacity for Block Diffusion Speculative Decoding
DFlare improves over DFlash by 11%, 8%, and 5% on Qwen3-4B, Qwen3-8B, and GPT-OSS-20B respectively, achieving average wall-clock speedups of 5.52x, 5.46x, and 3.91x, by using a lightweight layer-wise fusion mechanism that gives each draft layer its own combination of target layers, and by scaling training data from 800K to 2.4M samples.
Fast-dDrive: Efficient Block-Diffusion VLM for Autonomous Driving
Fast-dDrive, a block-diffusion VLA for autonomous driving, achieves SOTA ADE@3s and ADE@5s on WOD-E2E and reduces L2 error to 0.32m on nuScenes (22% improvement), while delivering 12x throughput speedup over an autoregressive baseline when integrated with SGLang, using a section-aware training recipe and a low-overhead test-time scaling scheme that forks N stochastic rollouts from a shared-prefix KV cache.
DFlash: Block Diffusion for Flash Speculative Decoding
DFlash, a block diffusion speculative decoding framework, generates draft tokens in a single forward pass and conditions the draft model on target model context features, achieving over 6x lossless acceleration across models and tasks, up to 2.5x higher speedup than EAGLE-3.
Accelerating Speculative Decoding with Block Diffusion Draft Trees
DDTree constructs a draft tree from the per-position distributions of a block diffusion drafter, using a best-first heap algorithm to select the most likely continuations under a fixed node budget, and verifies the tree in a single target forward pass with an ancestor-only attention mask, building on DFlash to improve acceptance length.
