- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes One Block Ahead (OBA), a training-free inter-block parallel decoding method designed to further improve the inference efficiency of diffusion language models. The key idea is to start denoising the next block before the current block is completed, reusing the accumulated progress through sampler-state inheritance, while employing block-causal attention and optimized GPU kernels to reduce computational overhead. Experiments on DiffusionGemma demonstrate promising efficiency gains, with a 42.3% increase in tokens per forward pass and a 16.3% improvement in throughput, at the cost of a 1.37-percentage-point drop in average accuracy. Overall, the method primarily improves inference efficiency rather than generation quality.
Critical strengths
I think the main strengths of this paper mainly show from the experiment perspective.
- The paper presents a solid and extensive experimental evaluation across multiple benchmarks. Through detailed ablation studies, the authors systematically investigate different aspects of OBA, including sampler-state inheritance, concurrent decoding schedules, attention mechanisms, and kernel-level optimizations. These analyses not only validate the effectiveness of the proposed method but also provide valuable insights into the roles of individual components and how they contribute to overall inference efficiency.
- The paper demonstrates meaningful engineering improvements by further accelerating DiffusionGemma, which already achieves high inference efficiency, through concurrent inter-block decoding and optimized GPU kernels. The reported 42.3% increase in tokens per forward pass and 16.3% improvement in throughput, without requiring additional training, highlight the practical value of the proposed approach for efficient diffusion language model inference.
Critical weaknesses
The main weakness which makes me confused is the limited comparison with FlowBlock: OBA's inter-block parallel decoding mechanism is highly similar to the existing FlowBlock approach. The main differences lie in the warm-up initiation policy and the sampler-state management and computational optimizations tailored to DiffusionGemma. However, the sampler-state components are inherited from DiffusionGemma, and the adapted FlowBlock baseline employs the same state inheritance mechanism. Although the authors make substantial efforts to adapt FlowBlock to DiffusionGemma, they retain the original readiness thresholds without systematic tuning for the new sampling mechanism. Since the warm-up initiation time is the key distinction between the two methods, the current experiments do not sufficiently establish OBA's advantage over a properly tuned FlowBlock baseline or its independent algorithmic novelty. A sensitivity analysis of the readiness threshold and a fair comparison of the accuracy–throughput trade-off would strengthen the evaluation.
Questions for authors
I raised four key questions for authors, and helpful answers will contribute to my rate update.
- Although the authors adapt FlowBlock to DiffusionGemma, they retain the original readiness thresholds (0.6 and 0.8). Given the differences in sampling mechanisms, block sizes, and readiness definitions, could the authors provide a sensitivity analysis of these thresholds and compare the resulting accuracy–throughput trade-offs? In particular, does OBA still maintain a clear advantage when FlowBlock is allowed to initiate warm-up earlier?
- The adapted FlowBlock and OBA share the same sampler-state inheritance mechanism, block-causal attention, and paired-block kernels, with the main difference being the warm-up initiation time. Could the authors clarify what fundamentally new algorithmic mechanisms OBA introduces beyond existing approaches? In particular, would FlowBlock become equivalent to OBA if its readiness gate were configured to allow immediate warm-up?
- The experiments show considerable variation in warm-up effectiveness across benchmarks, with relatively lower early token acceptance rates on tasks such as AIME and LiveCodeBench. Could the authors further investigate whether these differences are related to cross-block contextual dependencies or prediction stability? Is a fixed immediate warm-up strategy suitable for all generation scenarios, or could an adaptive strategy based on online sampling states achieve a better accuracy–throughput trade-off?
- OBA is evaluated only on DiffusionGemma, and its key designs are closely tied to uniform-state diffusion and model-specific sampler states. Could the authors clarify which DLM architectures or sampling paradigms OBA can generalize to, and what technical conditions are required for its applicability? If extending OBA to other models is challenging, it would be valuable to explain the underlying limitations and distinguish generalizable components from DiffusionGemma-specific adaptations. Even without additional cross-model experiments, a clearer discussion of these applicability boundaries would help the community better understand the broader significance of the work.
PS:The paper contains a few incomplete citation placeholders (?), and some statements in the Background and Related Work sections are overly absolute. For example, the claim that fully bidirectional DLMs cannot reuse KV caches overlooks existing approximate caching methods. The authors should address these citation issues and refine the technical statements for greater accuracy.
2 comments
Response to Rebuttal
Thank the authors for their detailed rebuttal and additional experiments. However, the response does not sufficiently distinguish OBA from FlowBlock and instead reformulate the contribution primarily as an engineering adaptation and system-level optimization. While these efforts have practical value, my concerns about independent methodological novelty remain unresolved and therefore I will maintain my original score.
1. Readiness-threshold sensitivity and accuracy–efficiency trade-offs: We agree that the transferred thresholds of 0.6 and 0.8 need not be optimal for DiffusionGemma. We also compare Native and OBA across the same temperature schedules: 0.8→0.4, 0.7→0.2, and 0.85→0.5. All comparisons use matched prompts, per-example seeds, output limits, and evaluation procedures.
In the sweep, immediate OBA achieves 83.80% accuracy, 22.30 TPF, and 2,766 denoising TPS. FlowBlock at readiness 0.2 achieves 83.10%, 20.87 TPF, and 2,839 TPS; readiness 0.4 achieves 84.35%, 18.33 TPF, and 2,641 TPS. Earlier admission is therefore competitive, with different policies favoring different accuracy–throughput trade-offs. Immediate OBA retains the highest TPF among these policies without readiness-threshold tuning. All three use full sampler-state promotion, the mechanism enabling useful inter-block progress in this uniform-state setting.
2. Relationship to FlowBlock and the contribution of OBA: In our adaptation of FlowBlock to uniform-state diffusion, immediate admission is indeed equivalent to OBA. However, this adaptation is not addressed in the original FlowBlock [1]. We study a setting combining strong reasoning performance, 256-token blocks, and an already efficient baseline of approximately 16 tokens per forward, extending beyond the settings evaluated in prior inter-block decoding work. Our contributions are identifying which sampler states must be promoted to preserve useful warm-up progress, and providing a comprehensive component-wise analysis of how state promotion, admission timing, attention structure, and kernel optimizations affect multi-block decoding. We will clarify this positioning in the revision.
3. Task-dependent warm-up effectiveness and adaptive admission: To answer the question, we added an analysis using all 30 questions from each AIME benchmark and length-stratified samples of 30 prompts each from LiveCodeBench and GSM8K. We measure consecutive warm-up prediction changes and sensitivity to predecessor-state updates while holding the warm-up sampler state fixed.
Rebuttal Table 1. Warm-up prediction stability and sensitivity to predecessor updates
As shown in Rebuttal Table 1, the experiment results confirm sensitivity to preceding-block updates, but do not establish consistently greater instability or sensitivity on AIME and LiveCodeBench than on GSM8K. Crucially, the paper’s full evaluation shows that OBA raises first-current-pass acceptance on AIME and LiveCodeBench from 3.4–3.9% to 25.9–30.7% (Figure 2), demonstrating useful warm-up progress despite evolving context.
Our readiness sweep also shows that state-dependent admission can improve the trade-off on individual tasks. On LiveCodeBench, readiness 0.2 improves accuracy from 64.10% to 65.86% and denoising throughput from 2,224 to 2,454 TPS relative to immediate admission. Because admission depends on the evolving sampling state, this directly tests an online-state-based alternative. No evaluated threshold is consistently best across benchmarks: immediate warm-up is a useful default, while admission timing provides an additional task-dependent control.
4. Applicability beyond DiffusionGemma: Thank you; we will add this discussion to the paper. OBA’s general principle is that a promoted block must carry whatever sampler state its tokens cannot reveal. In masked diffusion, the mask shows progress, so the tokens suffice (as in D2F and FlowBlock). In uniform-state diffusion, the tokens do not show how far a block has progressed, so the self-conditioning signal and denoising time must be promoted too. Continuous diffusion (e.g., SSD-LM) is the closest analogue: the state to promote is the noisy latent, its noise level and any self-conditioning. OBA requires block-autoregressive decoding and a decoder that accepts a block-causal mask over two blocks. The paired-block layout, full-state promotion and break-even analysis are general; the state contents, kernels and measured speedups are specific to DiffusionGemma, which is, to our knowledge, the only public large-scale model that is both uniform-state and block-autoregressive.
PS. Citations and technical statements: We thank the reviewer for catching these. We will correct the incomplete citations, which should cite Fast-dLLM v2 [2]. We will also narrow the statements the reviewer points to and cite approximate caching such as Fast-dLLM [3], which Section 5 also discusses.
[1] https://arxiv.org/abs/2607.17652
[2] https://arxiv.org/abs/2509.26328
[3] https://arxiv.org/abs/2505.22618