- Rating
- 1(−1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors propose to speed up guidance with GLASS-style transition kernels via doing reweighting of samples across a batch (all on the same conditioning) to more efficiently use the samples (via the batch) during guidance/steering. They evaluate on t2i models SD3 and FLUX on a variety of guidance tasks.
Critical strengths
- Very simple and elegant idea to utilize the batch.
- Very thorough accounting of details like NFE formulas, wall-clock times, metrics, etc.
Critical weaknesses
- I fundamentally disagree with how results are reported, ie, the batch size is not repeated in NFE numbers as it is NFE per image, this skews the results towards this paper. Currently, the paper hinges on scenarios where and the effect grows. It seems like that as this is almost a best-of- type algorithm. But how often does the user want to query a large batch all with the same prompt? And leading with my next point limited diversity,
- From Figure 3 it seems like metrics improves and diversity worsens as . I feel that when the user wants to sample they care a lot about diversity within the batch but this method seems to lose on diversity within the batch. So they advantages of increasing seems lost to me.
- Why is there no comparison to the limiting case of setting? This would isolate and strengthen the impact of the Gaussian bridge.
- The main point of this paper is reducing the compute burden of other strategies which use guidance via GLASS like FK-GLASS, but omit comparisons to few-step methods like MFMs or Diamond maps, thus I'm not sure I buy the justification of omitting it due to training. As a practitioner I'm much more inclined to use these to solve problems I care about as they massively reduce NFE and can be cheaply trained a la a DMF-styled fine-tune from a pre-trained flow matching model. I think a comparison to these is highly relevant for arguing why we should use the paper's method over these few-step stochastic flow maps.
Questions for authors
- Why compare to only FK-GLASS but not other GLASS guidance strategies that could be used like the Best-of-N done in GLASS?
- How do you address the diversity concerns as the batch size setting hinges on this? As far as I could tell diversity is never reported for the other methods. Again I feel like for the use case of this method the user cares about a large batch size when they care about diversity, otherwise just through the batch size into best-of-N to generate an even better single-image.
- Please report NFE with batch size and adjust best-of-N accordingly, etc so we can compare more concretely in Table 4 and figures. It feels off that the proposed method can "win" with no extra guidance steps at the baseline NFE of 25/28 in Figure 3 (also what reward is even being computed?) because of the batch size, this doesn't feel fair to other methods especially with diversity concerns. How does this graph look for all the reward metrics in this setting, so CLIP, PickScore, and image reward.
- How does this paper compare to guidance with flow maps like MFM/Diamond?
5 comments
I thank the authors for the detailed response. I looked at the PDF and did not yet see this incorporated into the revised PDF. Please let me know when these changes are worked in so I can review the entire revised paper to update my assessment as I wish to review everything within the context of the full paper.
Thanks, Reviewer w98q
Thank you for taking the time to review our response. We have now updated the PDF to incorporate the additional experiments and clarifications. In particular, we have clarified the intended generation scenarios in the Motivation and expanded the reward–diversity analysis to include baseline comparisons at comparable computational budgets. The additional validation experiments and implementation details are included in the appendix. We would appreciate your assessment of these changes in the context of the revised paper. Thank you again for your careful feedback.
[W1, W2, Q2, Q3] Batched Evaluation: Practical Relevance, Reward–Diversity Trade-off, and Compute Accounting
Please refer to Points 2, 3 of the General Response.
Thank you for raising these connected concerns. We agree that higher mean reward alone does not establish that a batch is more useful, and that reward gains should be assessed jointly with diversity and total computation. Our primary evaluation concerns generating and returning B images under a shared condition. Point 3 of our General Response explains the motivating scenarios, primarily providing multiple candidates for a single request, with jointly processing compatible requests as an additional setting.
Within this setting, our contribution is to provide control over the reward–diversity trade-off through cross-trajectory endpoint-sample reuse. Relative to uncoupled steering (h=0), bandwidth h controls sharing at a fixed output count and endpoint-sampling budget. Sharing can increase mean reward at the cost of within-batch diversity; we do not claim that stronger coupling is preferable for every application. Point 2 of General Response reports both quantities for competing methods and our bandwidth sweep across multiple computational budgets.
Our evaluation therefore reports the mean reward and diversity of all B returned images. All methods, including best-of-N, return the same number of images, and their reported generation NFEs include discarded candidates. We also evaluate BoN of Ours under the same selection protocol as the baselines to assess performance when final selection is desired.
To make the computational comparison explicit, we report both NFE per returned image and total batch NFE below. In the baseline-NFE setting of Figure 3, proposed cross-trajectory sharing reuses endpoint predictions already computed during the sampling trajectory, without additional endpoint-sampling network evaluations.
The table below summarizes representative low-budget SD3 results on 60 prompts, with B=8 and Stot=4 for Ours and Uncoupled. ImageReward is used for steering and selection; CLIPScore and PickScore are held-out metrics evaluated on the same returned images.** Diversity results for these settings are provided in Point 2 of our general response.
[W3] : h→∞ Limit and the Role of the Gaussian Bridge
Thank you for suggesting this ablation. We have added h=∞, which sets all bridge ratios to one while retaining reward weighting, providing an uncorrected-pooling control at the same sampling cost. As shown below, h=1 similarly yields reward and diversity close to this limit across all three budgets. Smaller bandwidths preserve more diversity at a reward cost, indicating that the finite-bandwidth bridge controls the trade-off relative to uncorrected pooling. Please see Point 2 of our general response for the additional results. Entries report ImageReward / Vendi on SD3.
Regarding the connection to best-of-B, selecting h→∞ allows high-reward endpoints to influence multiple trajectories, which can reduce within-batch diversity. All B final images are still returned.
[Q1]: Comparison with BoN-GLASS
Thank you for pointing out this missing baseline. We agree that the original BoN comparison does not replace an explicit comparison with BoN-GLASS, which generates candidates using GLASS and selects the highest-reward candidate. We have now added this baseline under the same output-count and selection protocol, including the generation cost of all discarded candidates. Point 2 of our general response reports its reward and within-batch diversity alongside FK-GLASS and our method at comparable computational budgets.
[W4/Q4]. Stochastic Flow Maps
Thank you for emphasizing the practical relevance of few-step stochastic flow maps. We agree that their training requirements alone do not justify omitting this comparison. We have therefore added experiments using Meta Flow Maps and Diamond Maps, with the publicly released checkpoints from the respective works. Please refer to Point 4 of General Responses for details.