- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Latent Q-Guided Generation (LQG), a value-guided test time framework that evaluates latent trajectories before denoising is complete for continuous latent DLMs. The idea is that to predict the terminal utility of partially denoised latent trajectories and allow candidate selection before completing the entire denoising and decoding process. The method is evaluated across unconditional and conditional generation tasks and shows improvements in several different metrics.
Critical strengths
- Predicting terminal utility directly from intermediate latent representation is a good idea. The finite-horizon MDP formulation provides a natural interpretation of the critic as an estimator of expected future utility.
- The overall empirical results is promising for improving MAUVE and BERTScore on both unconditional and conditional tasks.
Critical weaknesses
- So one claim the LQG makes is that it can identify promising trajectories early and prune the remaining candidate for better efficiency. But the main result still use the full denoiser calls, not after the pruning. So the experiments show the effectiveness of the latent-based reranking but not early pruning (with similar quality). So there misses a quality-efficiency trade-off.
- The paper emphasizes the TD policy, but the ablation show that TD learning alone is slightly lower than base denoiser. Most of the performance improvement comes from the cross-trajectory selection and margin losses. So it is hard to see whether the improvements come from TD learning, stronger critic capacity or the additional ranking supervision.
Questions for authors
Please check the weakness above.
2 comments
I thank the authors for the response. However, my concern about the role of TD learning remains. Overall, the responses addresses some of my concerns, but I will keep my current score.
Response to Reviewer Y4AN
We thank the reviewer for the constructive feedback. We provide the point-by-point response as follows.
W1
The revised Table 4 now reports the quality–efficiency trade-off of early pruning: pruning at step 48 reaches MAUVE 0.933 versus 0.780 for the single sample, and is 1.31× / 2.10× faster than terminal best-of-4 (Table R6).
(Table R6 = revised Table 4: a separately trained TD critic, with the reward fitted on 5,000 training texts; MAUVE uses test texts 2,500–3,500 as the reference; timed on one RTX PRO 6000. Because the critic and the reference differ, absolute MAUVE values are not comparable with the other tables and figures.)
Figure R1b: held-out MAUVE vs. seconds per output
(Figure R1b: ROCStories. The vertical axis is held-out MAUVE and the horizontal axis is seconds per output (batch 16, one H200). Each LQG prune curve goes from early to late pruning steps h from left to right (the rightmost point is the last step); the star is the history-based readout over completed trajectories; best-of-N decodes all N candidates and selects with the true utility. Times of hollow markers are estimated from H200 measurements; N = 8 and 16 are linear extrapolations.)
W2
TD alone already improves over the base denoiser, removing TD from the full objective lowers MAUVE, and a capacity-matched latent-SL critic does not outperform LQG, so critic capacity alone does not explain the gains.