- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes learning the token unmasking order in masked diffusion models instead of relying on heuristics based on quantities like confidence or margin. The authors introduce a lightweight policy network trained to favor positions where the denoiser is more likely to predict the correct token, and explore both training the policy alone and jointly training it with the denoiser. They evaluate the approach on across a wide range of tasks, generally finding improvements over heuristic ordering strategies. However, the gains are often modest, especially on larger language models like LLaDA-8B, where the learned policy does not consistently outperform high-confidence ordering.
Critical strengths
1. The method itself is conceptually simple and elegant. It only requires a lightweight network, which doesn't add much to inference compute, and is generally applicable to a wide range of models.
2. The evaluation covers a very good range of domains, including Sudoku, protein generation, and language modeling. The ablations are also useful, demonstrating improved accuracy with fewer diffusion steps, as well as robustness to stochastic decoding.
Critical weaknesses
1. The evaluation primarily compares against decoding order heuristics, such as high confidence, margin, and random. While the learned policy generally improves upon these heuristics, it's unclear to me how the proposed method would perform against other learned order baselines, such as [1,2,3], which aren't included. Such comparison is required to demonstrate the empirical contribution of the proposed method relative to the closest baselines; comparing only against the heuristics isn't sufficient to show the benefit of the proposed method.
2. I'm not convinced by the novelty or impact of the proposed method. While the training objective is elegant and simple, the underlying idea of prioritizing positions where the denoiser is more likely to make correct predictions is pretty intuitive and closely related to existing confidence-based ordering strategies. This would be less concerning if the empirical improvements were substantial, but the gains over training-free heuristics are generally modest; for example, on LLaDA-8B, the learned policy only slightly outperforms high-confidence ordering on some benchmarks, while performing worse on others. Given the limited algorithmic novelty and relatively modest empirical gains, I'm not convinced that the paper demonstrates a sufficiently significant contribution.
Questions for authors
-
Major: Can the authors provide comparisons against existing learned-order approaches, such as [1,2,3], under comparable experimental settings? If direct comparisons are infeasible, could the authors explain why and clarify what advantages their method offers over these approaches?
-
Major: The learned policy achieves only marginal improvements over high-confidence ordering on some LLaDA-8B benchmarks and performs worse on others (e.g., BBH and CoQA). Can the authors provide an answer as to why this occurs? Why does the learned order policy not work as well at larger scale?
-
Major: Since high-confidence and margin ordering require no additional training, can the authors quantify the additional computational cost of policy training and discuss whether the observed improvements justify this cost? How does the training efficiency compare with existing learned-order approaches?
Concerns addressed by author responses, increased score from 2 to 3.
[1] Hong et al., ICLR 2026, "Improving Discrete Diffusion Unmasking Policies Beyond Explicit Reference Policies".
[2] Xu et al., ICML 2026, "Scheduling Thoughts: Learning the Order of Thought in Diffusion Language Models".
[3] Jazbec et al., ICML 2026, "Learning Unmasking Policies for Diffusion Language Models".
Please respond
Hi reviewers,
Thanks for your work so far on this paper. Please respond to the authors before the end of the discussion period if you have not done so already, even if to acknowledge their response.