- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies whether adaptive decoding in dLLMs preserves the intended distribution of completed sequences. They show that joint-block reveal can preserve the target distribution while independently sampling tokens within a block may introduce error. So the authors apply a acceptance rule based on the ratio of action-selection probabilities before and after a remask in dLLMs. The experiments mainly measure target-distribution differences in the exact settings and endpoint differences between naive and corrected decoding in dLLMs. I highlighted the key sentence below.
Critical strengths
- I think the paper raises an interesting question about adaptive decoding in dLLMs. The distinction between selecting which tokens to update and predicting their new values is useful.
- The theoretical analysis is reasonably clear. The authors distinguish between monotone reveal and revision and provide explicit conditions for target preservation. I also like the separation between routing error and block factorization error, as these are two different issues that cannot necessarily be addressed by the same correction.
Critical weaknesses
- Unclear motivation for preserving the target distribution. My main concern is regarding the motivation part. I understand that adaptive revision can change the target distribution, but I am not convinced that why preserving this distribution is necessarily the right objective for dLLM refinement.
-
If revision is intended to correct incorrect tokens and improve reasoning, isn’t changing the original generation distribution may be actually desirable? For example, a revision may successfully replace an incorrect token with a correct one, making that position less likely to be revised again. However, your proposed MH correction could reject such a beneficial revision.
-
Thus, I think the paper needs to explain the logic for why preserving the target distribution is a must for practical dLLM decoding, rather than just assuming that distribution changes caused by adaptive revision are necessarily undesirable in the introduction, which is circular to some extent.
- The evidence that the proposed correction is actually beneficial is somewhat limited. Although the paper reports endpoint differences between naive and corrected revision, I do not think a larger Hamming distance directly demonstrates better target preservation or improved generation quality.
- Specifically, Appendix Table 7 shows that surprise-based correction slightly reduces GSM8K accuracy compared with naive revision across all three checkpoints in the main setting: from 18.4 to 17.4 for LLaDA Instruct, 2.3 to 2.1 for LLaDA Base, and 3.7 to 3.5 for Dream. The 64-token LLaDA-Instruct result also decreases from 30.5 to 28.1. These differences are really small and not convincing enough to me and they do not demonstrate a practical benefit from the proposed correction. I wonder why the task-level results are not discussed more directly in the main text.
- The connection between token-level and block-level revision is not sufficiently demonstrated. The paper discusses token and block updates under a unified framework in block diffusion models yet the main revision experiments appear to update one token at a time, while block remasking is evaluated separately.
-
In my understanding, revising the tokens in one block can change the conditional distributions of other blocks and previously revised blocks may need to be revisited. It is unclear how these cross-block interactions affect the proposed correction, especially when blocks overlap or are reconstructed in parallel.
-
I can see appendix I.10 discusses composite block actions, which is good, but I would like to see a clearer connection between this formulation and the actual block remasking implementation. For example, when selecting 2 or 4 tokens from a candidate pool, how is the joint selection probability of the entire block computed? Is it calculated from the actual block selection process, or simply approximated by multiplying individual token selection probabilities?
- The experiments are limited. The real dLLM experiments only use three checkpoints on only three datasets WikiText, GSM8K, and MBPP. Most experiments focus on 32 token continuations, with a 64 token extension only for LLaDA.
- I think these generation lengths are relatively limited for evaluating reasoning and code generation compared to existing dLLM studies. Although MBPP is included, the MBPP results are all N/A in Table 10 and I don’t know why there is no pass1 accuracy for MBPP. Therefore, I think the current experiments are largely limited compared to existing dLLM studies and not convincing.
- Limited method novelty. The proposed action ratio correction seems to follow the same MH detailed balance principle in previous work. I think the main contribution is applying these existing ideas to the context of dLLM decoding, rather than proposing a fundamentally new dLLM correction method. Given the simplicity of the correction, I would expect stronger evidence that it provides meaningful benefits in practical dLLM applications.
Questions for authors
Q1 Why is preserving the target distribution necessarily the right objective for adaptive dLLM refinement? If the goal is to correct incorrect tokens and improve reasoning quality, wouldn't changing the original generation distribution sometimes be beneficial? Could the MH correction reject useful revisions?
Q2 How do the authors explain the GSM8K results in Appendix Table 7, where surprise-based correction slightly reduces accuracy compared with naive revision across all three checkpoints?
Q3 Could the authors clarify how the proposed method handles dependencies between different blocks during iterative revision? In particular, if revising one block changes the conditional distributions of other blocks, how is this interaction handled? How is the joint selection probability of a block implemented and computed in the actual remasking experiments?
Q4 How exactly is surprise computed for an already generated token in LLaDA and Dream? Is the token masked before estimating its probability?
Q5 Could the authors provide experiments on longer reasoning and fix the NA results in coding tasks, and report the computational overhead and effective number of accepted revisions? This would help establish whether the proposed correction offers practical benefits. Also, I noticed that some experiments are 2 seed, some are 4 seeds and all results lack std. I strongly suggest using a consistent number of seeds across experiments and reporting the mean and standard deviation especially for GSM8K and MBPP to make the results more reliable and easier to compare.