- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper improves diffusion-based drafting for speculative decoding of autoregressive language models. dloops identify a “repetition trap”: when draft positions predict tokens without observing earlier proposed tokens, neighboring positions can produce redundant repetitions, leading to early rejection. It addresses this through two passes of the same drafter. The first generates an initial token block. The second retains a selected prefix and regenerates the suffix conditioned on that prefix. A complementary prefix–suffix training objective prepares the shared model for both tasks. At inference, multiple candidate prefixes can be used to construct branches for joint target verification. Experiments on Qwen3-4B and Qwen3-8B ashows improvements in both acceptance length and decoding speed.
Critical strengths
The design that reuses existing parameters is simple and straightforward.
The repetition trap seems interesting.
Experiments show gains on speedups on qwen-4b and 8b models over dspark and dflash.
Critical weaknesses
Is it possible for the method to extend to even larger model like 32b? Experiments use two target sizes from the same Qwen3 family. It remains unclear whether the gains persist for larger targets.
Could you discuss and compare your method with dflash2 if possible?
Could you please discuss the situation when batch size > 1, and potentially in large batch settings, for the speedup gains. Will there be any obstacles/reduction in speeding up in such scenarios?
Could you discuss the resource utilization for using such drafting mechanisms during inference?
Questions for authors
see weakness
General response
Dear AC,
We sincerely appreciate your time and effort in coordinating our submission. We also thank the reviewers for their constructive feedback and for recognizing the following strengths:
Well-motivated problem identification:
“The paper identifies the repetition trap in block diffusion drafting and provides empirical evidence of its prevalence and association with shorter acceptance lengths.” (@Cuzn); “The repetition trap is a clear, intuitive motivation, supported by draft-level statistics and a simple theoretical explanation.” (@ZaVi); “The repetition trap seems interesting.” (@n7Dy).
Simple, parameter-efficient architecture and loss designs:
“D-Loop reuses the same drafter for initial proposal and prefix-conditioned suffix regeneration, avoiding a separate drafter while enabling improved draft quality.” (@Cuzn); “The idea is simple and easy to integrate: it adds intra-block conditioning by reusing the existing drafter, with no extra parameters.” (@ZaVi); “The design that reuses existing parameters is simple and straightforward.” (@n7Dy).
Consistent empirical improvements:
“Experiments across two model scales and eight benchmarks show improvements in acceptance length and decoding speed over DFlash and DSpark.” (@Cuzn); “Acceptance length improves consistently across two model scales, three task domains, and both greedy and sampling decoding.” (@ZaVi).
During the discussion, we provided additional experiments and point-by-point responses. The main responses and their locations in the revised paper are summarized below.
(1) Section 3.1, Table 2 reports repetition rates for DFlash, D-Loop, and DSpark. D-Loop reduces first-pass repetition by 73.7%-83.0% across three benchmarks.
(2) Section 4.2, Table 7 adds comparisons of inference schedules, prefix selection, and training objectives. The full looped schedule gives the largest acceptance gain.
(1) Section 4.2, Table 5 clarifies that both D-Loop and D²SD execute two five-layer passes, but D-Loop shares one parameter set.
(2) Appendix B.3, Table 11 adds DFlash 2 comparisons: D-Loop improves acceptance on all three datasets, while DFlash 2 remains faster on Alpaca.
(3) Our responses also include D-Loop K=1 and exploratory DSpark branching comparisons. Against reproduced D²SD, mean acceptance improves by 9.7% at T=0 and 11.2% at T=1; reproduced speedups are explicitly labeled as estimates.
(1) Appendix B.1, Table 9 adds B=8 results, with 21.9% higher mean acceptance at T=1.
(2) Appendix B.2, Table 10 extends evaluation to Qwen3-Coder-30B-A3B: mean acceptance improves by 25.7% at T=0 and 46.1% at T=1 over single-pass inference with the same checkpoint. Supplementary speedups are labeled as estimates.
(1) Section 4.2, Table 8 evaluates 1-32 concurrent requests per GPU, showing 1.19-1.42x higher throughput than the single-pass control.
(2) We also report memory and latency costs, acknowledging that high concurrency reduces absolute throughput and that weight sharing does not remove runtime overhead.
(1) Section 4 specifies the H800 hardware, inference framework, and main benchmark timing protocol.
(2) Table 6 distinguishes instrumented profiling from benchmark timing.
(3) Appendix B distinguishes supplementary speedup estimates from measurements using per-dataset AR baselines.
Our work identifies and analyzes the repetition trap and introduces shared-parameter looped refinement with complementary prefix-suffix training. The revised paper strengthens the empirical support while clarifying the conditions under which improved acceptance offsets the additional inference cost.
Thank you again for your time and consideration.
Best regards,
The Authors