- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper introduces Prefix-Denoising Consistency (PDC), a test-time self-verification and scaling method tailored for DLMs, which is particularly important when standard low-temperature DLM decoding suffers from trajectory collapse during repeated full generations, making naive parallel self-consistency (majority voting over independent runs) ineffective because samples follow near-identical unmasking paths. PDC takes an initial complete output, preserves an exact prefix at specific keep rates (), remasks the remaining suffix, regenerates the text, and aggregates candidate answers via majority voting. The proposed method is tested across mathematical reasoning (e.g. GSM8K, MATH-500, SVAMP) and commonsense reasoning benchmarks (e.g. CSQA, SQA) using models like Dream-7B and the LLaDA family.
Critical strengths
-
The paper effectively identifies and formalizes the "reproduction gap”, proving theoretically in Theorem 2.2 that method performance depends on this gap. Additionally, they demonstrate empirically that correct DLM trajectories are significantly more reproducible under prefix conditioning than incorrect ones (), providing a solid foundation for the approach.
-
Strong Compute-Efficiency Profile is a plus: PDC outperforms standard full-generation self-consistency (INIT x4) while consuming fewer total denoising steps ( vs. ).
-
Strong Robustness Validation is a plus: The paper provides thorough checks across alternative unmasking strategies, semi-autoregressive blockwise settings, and varying sampling temperatures (demonstrating robustness even under stochastic decoding)
Critical weaknesses
-
Unless I misunderstood the paper, the underlying mechanism heavily mirrors established prefix-consistency and prefix-consensus frameworks originally designed for autoregressive language models to improve self-consistency and reasoning reliability (e.g., Iwase et al., "Reliable Chain-of-Thought via Prefix Consistency" and Jindal et al., "The Path of Least Resistance: Guiding LLM Reasoning Trajectories with Prefix Consensus"). Translating this concept to discrete diffusion’s masked output window reads as a straightforward architectural adaptation of existing AR verification strategies. Beyond achieving a minor reduction in total denoising steps, it remains unclear what fundamental algorithmic advance this adaptation provides for diffusion models.
-
I believe that the empirical results expose a critical limitation: improvements on non-math, commonsense reasoning benchmarks (such as CSQA and SQA) are largely negligible (+0.00 to +0.98 points), questioning whether the method generalizes to broader text domains or is strictly specialized for structured arithmetic tasks. While short outputs naturally limit trajectory exploration in AR models, this issue is exacerbated in DLMs. This occurs because DLM outputs are bound to a fixed length window and token-level remasking operates across this static span; forcing prefix-conditioned regeneration on short, non-derivational tasks strips away the sequence runway required for meaningful alternative trajectory divergence. Consequently, the method functions more as a specialized arithmetic-correction heuristic than a universal test-time scaling solution, raising the question of what additional techniques are required to overcome this inherent DLM limitation.
-
Because PDC depends entirely on an initial generation to anchor the prefix, its overall success is tightly bounded by the structural soundness of the base model's initial setup. If the preliminary prefix contains fatal logical or arithmetic flaws, partial suffix remasking is structurally incapable of rescuing the trajectory, rendering the verification loop ineffective for fundamentally malformed initial runs.
Questions for authors
Q1: Given that PDC yields robust gains primarily on multi-step arithmetic datasets like GSM8K and MATH-500 while showing negligible improvements on commonsense reasoning benchmarks like CSQA and SQA, any scientific explanation of why this happens and how this can be improved?
Q2: In AR models, prefix-anchored methods benefit from long-form chain-of-thought outputs that provide ample token runway for trajectory divergence. In contrast, how do the authors reconcile the structural reality of discrete diffusion language models where generation is bound to a static length window with token-level remasking distributed across the entire span when applied to short-form or non-derivational tasks where prefix preservation strips away the necessary exploration runway?
Q3: In Section 2.2, the theoretical characterization of PDC's expected accuracy relies on a stylized binary answer space and models the three keep-rate regenerations using under conditional independence (Eq. 2–5). Given that discrete diffusion language model trajectories share a common structural backbone from the initial prefix , how do the authors justify the conditional independence assumption among in practice, and to what extent does correlation across these prefix-conditioned trajectories violate the bounds derived in Theorem 2.2?
Q4: In Appendix B (Table 4), it seems like certain model and dataset configurations (e.g., LLaDA-8B on MATH-500 at length 512, or specific settings where same-wrong persistence spikes) exhibit negative separation metrics ( shown in red). Under what specific conditions do these failure modes occur where wrong answers become more reproducible than correct ones, and how does the majority voting mechanism recover when multiple keep rates fall into this negative-gap regime?
We thank the reviewer for the detailed reading of the theory and the appendix. Additions are in red in the revised PDF: Appendix I (Tables 13-16), Appendix I.1 (Tables 17-18) and Appendix K (Limitations). Pairs "a / b" below are LLaDA-1.5 / LLaDA-8B.
1. What PDC adds over AR prefix-consistency (Table 13).
PDC builds on prefix consistency but uses prefix-conditioned suffix denoising to obtain alternative answers from a single completed DLM trajectory. Iwase et al. use prefix regeneration to assess candidate reliability, while Jindal et al. cluster short reasoning prefixes and prune non-dominant clusters. PDC instead regenerates from several prefix lengths of one initial output and votes only over the regenerated answers.
This distinction matters in our low-temperature setting. At temperature 0.2, four independent LLaDA generations give the same final answer on 95% of GSM8K problems, and INIT ×2 / ×3 / ×4 stay within 0.6 points of INIT across all ten LLaDA settings. We implemented PC-WMV on the same DLMs and benchmarks at a nominal budget of 2.5T; it stays within 1.1 points of INIT across these settings. On GSM8K, PC-WMV achieves 61.4 / 61.8, compared with 66.3 / 65.9 for PDC (Table 13). Depending on the keep rate, PDC’s regenerations move away from an initially wrong answer in 12–78% of GSM8K cases.
PDC also requires no exposed weights, logits, or intermediate denoising states: it uses the final text and an interface supporting fixed-prefix regeneration (Section 1).
2. Small gains on CSQA and SQA; Q1 (Table 15, Appendix K).
We agree that the gain is smaller in non-math tasks. For LLaDA at keep rate 0.5, the reproduction gap R+ minus R- is 67-73 points on GSM8K, 38 on MATH-500 and 34-50 on SVAMP, but 8-10 on CSQA and 7 on SQA. Theorem 2.2 ties the gain to this gap, so a small gap predicts a small gain: the commonsense results follow the theory rather than contradict it.
Mechanistically, a wrong commonsense answer is a belief error that the model reproduces from any prefix, whereas a wrong math answer is usually a local derivation error that a re-derivation avoids. PDC therefore targets derivational errors; Appendix K states this as a limitation.
3. Q2: fixed window and exploration room (Appendix I, "Output length and regeneration room").
We measured it. LLaDA outputs fill the 256-token window on GSM8K and MATH-500, so the 0.1 regeneration has on average 231 free positions and the 0.9 regeneration still 28-33. Dream uses on average 227 of 512 tokens on GSM8K and 62 of 128 on CSQA, so even its 0.9 regeneration has more free positions than the model used. Appendix K notes that fixed windows can constrain longer derivations. Thank you for your clarification.
4. Dependence on the initial generation (Appendix K).
We respectfully disagree that the initial generation tightly bounds PDC. A wrong initial answer is not locked in: on GSM8K the regeneration at keep rate 0.5 departs from it in 78% / 72% of cases (Table 15) and reaches the correct answer in 45% / 41%. Nor do most errors sit in the early setup: where a wrong arithmetic step is detectable, the first one lies after the 0.5 cut in 76% / 74% of wrong GSM8K outputs (Appendix I.1). The bound applies only when the early framing itself is wrong, which Appendix K states as a limitation.
5. Q3: conditional independence (remark "Scope of Theorem 2.2", Section 2.2; Table 15).
The theorem is a stylized model, now stated as such, and we checked both of its simplifications. On GSM8K the pairwise phi correlations between the correctness of the three regenerations, given a correct initial answer, are at most 0.19 / 0.14, and the product-form majority probabilities are within 2.5 points of their empirical values; on MATH-500 the correlations reach 0.25.
The larger discrepancy is the binary answer space: 8.0% / 5.7% of GSM8K and 15.2% / 12.0% of MATH-500 problems move from one wrong answer to another, which the theorem counts as corrections. It therefore predicts 74.5 / 71.9 on GSM8K against observed 66.3 / 65.9.
6. Q4: negative separations in Table 4.
One correction first: the MATH-500 / LLaDA-8B / L=512 row is positive at all three keep rates. The negative cells are SVAMP / LLaDA-8B / L=512 at 0.1 (-3.8), SQA / LLaDA-8B / L=256 at 0.1 (-3.3) and four cells below one point in magnitude at keep rate 0.9 on CSQA and SQA.
They arise (a) at degenerate lengths, where few answers are extractable and R- is computed over a handful of wrong answers, and (b) at keep rate 0.9 on multiple-choice tasks, where both rates approach 100% and the difference is within noise. The vote recovers because V3 is monotone in each coordinate, so one negative coordinate does not flip the sign when the others are large. The caption of Table 4 now says this, and Table 15 gives the conditioning-set sizes.