- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes VISTA, a training-free scheduler that automatically selects which timesteps to apply reward guidance in reward-guided Sequential Monte Carlo (SMC) for discrete diffusion models. The key idea is to formulate sparse guidance as an approximation problem over the ideal full-guidance probability trajectory . The authors derive an estimable upper bound, , on the trajectory deviation , expressed in terms of expected value functions. Using only a small number of full-guidance warmup runs to estimate , VISTA then finds the optimal guidance schedule under a fixed budget constraint via dynamic programming. The method is evaluated on Binary MNIST, toxic text generation, CIFAR-10, DNA, and protein fitness tasks, and compared against manually designed scheduling strategies such as Interval-, Uniform, Top-, and Top-.
Critical strengths
-
The problem formulation is well-motivated. Determining when to apply guidance in sparse SMC remains a relatively underexplored research direction, and the observation that existing schedules largely rely on fixed heuristics is valid.
-
Approximating the entire probability trajectory rather than only the final marginal distribution is conceptually meaningful. The intuition that correcting only the final timestep may lead to problems under a finite particle budget is also convincing.
Critical weaknesses
-
is monotonically decreasing with respect to , meaning that the unconstrained optimum of the proposed objective is always full guidance. However, the experimental results show the opposite trend: in four out of six benchmarks, full guidance, which is treated as the gold standard, ranks among the worst-performing methods. If the optimum of the proposed objective corresponds to one of the worst empirical outcomes, the claim that better performance arises from closely approximating the full-guidance trajectory is difficult to justify. In Section 5.5, the authors briefly attribute this discrepancy to the fact that overly frequent correction can reduce particle diversity. However, this explanation fundamentally calls into question the validity of the objective function underlying the entire paper.
-
The evaluation metric is circular and fails to reflect actual performance.The columns in Tables 3/4/8/9/10/11 and the UTD columns in Tables 6/7 directly report the objective optimized by VISTA. Moreover, the same estimated is reused for evaluation, introducing in-sample optimization bias. Excluding these circular metrics, only runtime and Unique Valid remain as independent evaluation metrics. More importantly, the proposed surrogate fails to predict actual performance rankings. These ranking reversals raise a fundamental concern: the surrogate objective, whose optimization constitutes the core methodology, does not consistently correlate with actual performance.
-
The 5.35$\times$ speedup claimed in the abstract is not attributable to VISTA and excludes warmup overhead. In Table 8 (), Interval-1 through Interval-5 take 33.98--34.82 seconds, whereas VISTA takes 38.16 seconds, making it slower under the same guidance budget. The speedup comes entirely from sparse guidance, which all baselines share, rather than from VISTA's scheduling strategy. Moreover, the reported speedup excludes the additional cost of full-guidance warmup runs.
-
Presentation and Writing Issues. The paper contains several inconsistencies and proofreading errors:
- Line 1022 contains an uncorrected LaTeX artifact (
"'latex). - Figure 4 discusses CIFAR-10 but refers to ``unique toxic samples'' in its caption.
- Table 9 contains a formatting error: ``20.43 027.02''.
- The Full Guidance row in Table 4 omits uncertainty reporting (3.12).
- Sections 5.4 and B.3.1 describe nearly identical settings but report inconsistent values for (0.3 vs. 0.2) and warmup time (19.5s vs. 18.7s).
- ``TDS'' appears in Table 11 without any definition or citation.
- The main text provides almost no quantitative results, relegating them to the appendix, while the axes in Figures 2/3/4/6 are difficult to read.
These issues collectively undermine the clarity and overall presentation quality of the paper.
Questions for authors
See the weakness.
5 comments
W2. Independent evidence for the scheduling criterion
We have labeled the fitted /UTD columns as selection diagnostics. We then enumerated every schedule in ten small diffusion models and evaluated its actual path deviation. At 3/4/6 steps, the mean Spearman correlations were 0.872/0.746/0.572, with selected-schedule mean ranks 3.6/220, 24.0/495 and 351.8/924. The bound is loose in magnitude (). Its ranking is most informative at small budgets. The finite-particle reward and distinct-yield rankings are reported alongside it (Appendix D.2, Table 13, pp. 33–34).
We also scored frozen masked-protein schedules on disjoint warmup traces. VISTA did not have a consistent held-out surrogate advantage over Top- or Uniform in that check. We have reported it separately from held-out generation quality in Appendix D.3 (p. 34). The measured DNA output below provides an independent practical evaluation.
W3. What VISTA achieves at the reported cost
At 15 guided steps on toxic text, VISTA achieved 0.99 Unique Toxic Ratio in 38.16 s, versus 1.00 in 204.23 s for Full. The faster schedules at that budget achieved at most 0.89. Sparsity supplies the saving over Full, and placement determines the quality attained with those calls. The ratio is post-selection latency. We have reported the 639.6 s startup and the startup-inclusive comparison in §5.2 and Appendix D.6 (pp. 7, 37).
On DNA, every method paid for its own tuning and any required warmup within a nominal 1,800 GPU-second budget. VISTA outproduced Uniform in all three trials, by , and . The ratios to Top- were , and . Both value-based methods paid for the same warmup and received its outputs. Rates count distinct valid candidates within each batch and sum across batches. We have included all trials in §5.4, Table 3 (pp. 8–9), and measured sampling-time accounting in Appendix D.1, Table 12 (p. 33).
Intro & W1. The full-guidance reference and finite-particle outcomes
Thank you for examining the objective, independent evidence and runtime accounting. We have added direct path-fidelity measurements and a three-trial compute-budget comparison, and brought quantitative results into the main text. Revisions are in blue. Locations below refer to the revised PDF.
VISTA solves the fixed-budget problem in §4.2. Full guidance has zero population path deviation. With only T′ guided steps available, the question is which placements best approximate that path. Theorem 4.3 bounds this deviation, and DP optimizes the resulting fitted objective.
The reference πt∗ is induced by the reward-regularized control objective in §3.2. Distinct-valid yield also depends on the joint law of a finite particle batch. Even two equiprobable valid states give 1.5 expected distinct states under two independent draws and 1.0 under two identical copies, with the same individual marginals. In the B200 protein rerun, 16-step VISTA produced 255 distinct valid candidates versus 147 for Full across 20 batches. The gain comprised 20 more valid outputs and 88 fewer duplicates. Under uniform diffusion, Weighted VISTA produced 180 versus 58, despite 11 fewer valid outputs, with 133 fewer duplicates. These counts quantify the endpoint difference. They leave its ancestry mechanism open.
We have clarified Definition 3.1, Figure 1 and the bound's population scope (pp. 4–5), and added the counts in §5.5 and Appendix D.4, Table 15 (pp. 9, 34–35).