- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper investigates whether frozen DLM hidden states contain information about which unmasking decisions lead to better future generation outcomes. It proposes LAVR, which estimates candidate-specific action values through offline rollouts and learns to predict them from current hidden states. The results show statistically significant but small improvements in Path-LL prediction, while task-correctness action-value prediction shows no reliable improvement.
Critical strengths
- Exploring whether current hidden states encode the future value of unmasking decisions is an interesting and promising direction.
- The Path-LL prediction gains are statistically significant and reproduced on independent document pools.
Critical weaknesses
Limited practical significance
Path-LL ranking gains are marginal (ΔConcordance ≤ 0.0094). Moreover, the observed weak or inconsistent alignment with task correctness raises questions about whether Path-LL is a suitable surrogate for better unmasking decisions. No closed-loop experiments demonstrate whether these predictive gains improve generation quality.
Limited backbone diversity
The larger-scale experiments use only Nemotron-Diffusion-3B. Evaluation on other representative DLMs, such as LLaDA or Dream, would strengthen the findings, although the computational burden is understandable.
Limited evaluation scope
Local Path-LL is evaluated only on OpenWebText with 169.6M models, while task-correctness prediction is evaluated only on easy mathematical benchmarks (GSM8K and SVAMP) with Nemotron-3B. These differences in models and datasets make it difficult to isolate the effect of the reward choice.
Questions for authors
- Given the marginal Path-LL gains and weak alignment with task correctness, what practical applications do the authors envision for LAVR?
- Could the authors discuss the generalizability of their findings to other DLMs and non-mathematical tasks?
- What are the GPU-hours required for the local Path-LL experiments, including replications A and B? What inference-time overhead would the learned readouts introduce?
2 comments
Thanks for the detailed rebuttal and additional experiments. The new experiments address some of my concerns.
However, the improvements are still quite small, and the closed-loop NLL gain is not statistically significant. I'm still not convinced that these gains translate into meaningful improvements in generation quality.
Therefore, I maintain my original score.
We thank you for the review and for recognizing that exploring whether hidden states encode the future value of unmasking decisions is an interesting and promising direction, and that the Path-LL gains are statistically significant and reproduced on independent document pools. We address the three weaknesses and three questions below, including new closed-loop decoding, LLaDA-8B, reward-isolation, and cost studies.
W1 & Q1: Practical Significance and Use
Thank you for these questions. The Path-LL gains are measured beyond 100 output, distributional, and trajectory features that include current confidence (App. B.3), and they carry over to decoding. We used the readout to choose actions under MDLM confidence decoding. In the executed-step study, the chosen action is committed on a new 200-document pool and the original policy finishes the generation. In the closed-loop study, the readout chooses the action at every step on 400 new OWT documents under the same NFE budget, and an external language model, independent of the Path-LL target, scores the output:
The executed-step gain recovers 7.6% of the gap to an independent oracle (−3.2770). The closed-loop study also compares the standard orderings:
Path-LL value is therefore a usable decoding signal, and LAVR yields the lowest closed-loop NLL of the four policies under the same NFE budget, as judged by an external model. For Q1, the applications are value-guided unmasking, shown here, and offline selective generation with the global-state readout, which adds 6.12 pp correctness at 50% coverage (Table 2). We have added both decoding studies to the appendix of the revised PDF.
W2, W3 & Q2: Backbones, Data, and Reward Isolation
Thank you for these suggestions. Local Path-LL is demonstrated on MDLM and SEDD on non-math OWT text, and two new studies extend the backbones and isolate the reward. On LLaDA-8B, 400 documents under a fixed policy are split into 240 training, 60 validation, and 100 test documents. On Nemotron-3B, 750 GSM8K C+D prompts keep the states, candidates, and readout architecture fixed and change only the reward target, with correctness labels raised from 8 to 32 completions:
On LLaDA-8B, pairwise concordance also rises from 0.5234 to 0.5280 (+0.0046 [−0.0007, 0.0099]). On Nemotron-3B, the two targets differ in label reliability:
Path-LL is therefore readable on both non-math and math text and from 169.6M to 8B parameters, and with model, states, and readout architecture held fixed, the contrast between Path-LL and correctness follows the reward choice itself. We have added both studies to the appendix of the revised PDF.
Q3: Compute Cost and Inference Overhead
Thank you for asking about cost. We measured latency on one A100 80GB GPU with MDLM-169.6M, six candidates, H=16, and matched precision and batching:
Rollout replicates differ from model forward-pass counts. A deployed readout uses current activations and a fitted prediction head, so it adds 5.0% inference overhead, launches no candidate rollouts, and is 13.3× faster per step than direct lookahead. We have added this benchmark to the appendix of the revised PDF.