- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
In masked diffusion models, remasking can help bypass the "locked-in" problem and potentially improve generation performance. The paper identifies two biases in parallel remasking: drift bias and staleness bias. They proposed a training-free method BReSC to address these biases: the method uses an entropy-balanced remasking policy with coordinate-wise detailed balance, also an online optimization routine by avoiding high-interference parallel updates. A theoretical justification is presented, and BReSC is empirically shown to surpass baselines in many benchmarks.
Critical strengths
- The theoretical derivations look correct to me. On many settings, the method outperforms a strong baseline ReMDM. The method may serve as a strong inference-time remasking strategy.
Critical weaknesses
- The theoretical guarantee is limited. Detailed balance assumes frozen entropy estimates, but in practice the sampler refreshes them dynamically.
Questions for authors
- The dependency-aware controller seems to contribute a substantial fraction of the reported improvements. This impact may be larger than the contribution of entropy-balanced remasking. Could the authors provide a controlled 2×2 ablation comparing uniform and entropy-balanced policies, with and without the staleness controller, across matched decoding budgets?
- The authors may consider refining the presentation of figure 1.
3 comments
I thank the authors for their insightful rebuttal. My concerns are mostly addressed, so I will raise my score to 3.
Thank you so much for your thoughtful engagement and for raising the score! We’re glad we could address your concerns, and we appreciate your feedback, which definitely helped us improve the paper!
We sincerely thank the reviewer for the assessment and for the suggestions on the ablation and presentation. New material is highlighted in red in the revised PDF.
W1: Limited theoretical guarantee.
A: Theorem 1 in fact gives BReSC the local guarantee it needs for practical inference. As discussed in Inference-time Adaptation (Section 3.2), Theorem 1 holds entropy fixed, while BReSC refreshes it as generation progresses. This is a practical adjustment for inference time. Empirical work on LLM inference has shown that generation can benefit from tilting the model’s sampling distribution using information available during decoding [1,2]. Our contribution is to use entropy to express these preferences and still satisfy detailed balance. As more tokens are revealed or revised, the preferred target can change. BReSC refreshes its entropy estimates so the target can adaptively capture the evolving inference preference.
Therefore, Theorem 1 can be understood as the local guarantee BReSC needs in practice. It tells us how to balance the moves for the target we prefer at the current stage of inference. When BReSC refreshes entropy, the same construction gives balanced moves for the new target. The full inference trajectory can thus follow a changing target, with Theorem 1 providing a principled MCMC design rule at each stage. Importantly, our experiments support the value of this adaptive design in practice. We believe this shows how principled MCMC can guide adaptive sampling in practice in a setting where effective decoding rules are still poorly understood.
Q1: Uniform/entropy × controller-off/on ablation.
A: Thank you for the suggestion! Following your request, we compared three policies on OWT at T=128. BReSC (EE) uses entropy for remasking and decoding. EU uses entropy for remasking and uniform decoding. UU uses uniform rates for both. EE satisfies detailed balance for the entropy-tilted target. EU and UU both break detailed balance. We tested each policy with and without the controller.
Overall, the balanced policy (EE) performs better than the others, and the controller is specifically useful for BReSC (EE). With EE, the controller raises MAUVE from 0.119 to 0.150 and lowers PPL from 29.2 to 28.9. The results are added in Appendix E.1.1.
The controller's benefit is less clear with EU and UU, but this is consistent with how the two components work together. The entropy-balanced policy and the staleness controller are tightly coupled. Theorem 1 gives us a drift-free sequential reference for Theorem 2. Theorem 2 bounds the extra error from using cached predictions, and its interaction terms guide which tokens the controller updates together. With EU and UU, even fresh sequential updates can drift from the target. Staleness control alone leaves that drift in place. These results show the practical value of our theory.
Q2: Refine Figure 1 presentation.
A: We have redrawn Figure 1 as vector artwork, with clearer labels and more consistent typography and layout. See Figure 1 in the revised PDF.
Thank you again for your suggestions. We hope the clarification of Theorem 1’s role during inference and the new ablations address your main concerns. We would appreciate it if you reconsidered your assessment in light of these additions.
[1] The Curious Case of Neural Text Degeneration. ICLR 2020.
[2] Locally Typical Sampling. TACL 2023.