- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses the high cost of evaluating candidate solutions under limited search budgets in tasks such as drug discovery and image generation. It proposes BFMT, a training-free sampling framework that combines generative models with tree search. BFMT uses Flow Maps to reduce node evaluation costs and a bootstrapped sufficient-statistic mechanism to construct stochastic branches that preserve diversity. Guided by historical feedback, non-uniform generation steps, and the remaining budget, it adaptively shifts from broad exploration to fine-grained local refinement, aiming to find more high-quality candidates with limited computation and feedback.
Critical strengths
-
theoretical results are strong, such as "the sampling error decays polynomially with respect to the total sampling budget"
-
this paper is well written.
-
the studied problem is important and related works are well presented.
Critical weaknesses
-
do not use underlines in the title. do not use colors in the main paper. too many color using for texts and formulations! make this paper looks informal. The overall writing style is a bit strange, like a teaching note in top US university (text box using etc).
-
for "Budget-Aware Node Selection", is there some theoretical guarentee?
-
line 239, Starting -> starting
-
too many descriptive words, it is recommended to use some psedo codes. can not follow very well.
-
QED, SA attributes are too easy to attain in the python rdk toolkit, will them really represent the true merit of a mol. how far is the designed mol. from real world application like drug design.
-
position of related works is a bit strange.
-
too many contributions. it is better to use three to summarize them.
Questions for authors
-
will the proposed UCT tree is proved to find the global optimal?
-
mol. design papers (related works) are substantial, e.g., https://arxiv.org/html/2609.01608v1.
the compared baselines are too small. only one is used to do comparison.
-
is it possible to include some Bayesian opt. methods as baselines?
-
is there any numerical results for image tasks?
-
how is the scaling law of the proposed method, like for very difficult math/code tasks, like finding a counter case for difficult math problem
4 comments
Response to Reviewer m4eb (Part2: Q2 to Q5)
Q2: mol. design papers (related works) are substantial, e.g., https://arxiv.org/html/2609.01608v1. The compared baselines are too small. only one is used to do comparison.
Thank you for this question. While our work focuses specifically on inference-time sampling, the suggested approach relies on fine-tuning, representing a distinct methodological direction. Nonetheless, we appreciate the pointer: we have added a paragraph on fine-tuning methods to the related work, including the suggested reference (lines 479-490).
And because BFMT functions as an inference-time sampler capable of building upon any state-of-the-art flow-based generative model, we adopt the recently introduced flow-based generative model (i.e., CFM) as the underlying generative prior. Comparing our approach directly against CFM therefore allows us to isolate and evaluate the specific effectiveness of the BFMT framework. The purpose of the molecular experiment is to demonstrate the generalizability of BFMT across different domains, and the comparison with CFM further highlights its effectiveness in a fundamentally different modality. In contrast, we provide a more extensive experimental comparison with existing state-of-the-art approaches across two different computer vision problem settings.
Q3: is it possible to include some Bayesian opt. methods as baselines?
Thank you for this question. Bayesian Optimization approaches do not fit in this setting. BFMT's objective is to sample from a reward-tilted distribution, so the goal is to produce diverse, high-reward samples, which is suitable in settings where the deliverable is a diverse batch and/or the reward is a proxy. However, Bayesian optimization directly optimizes for the single candidate that maximizes the reward, with no distributional guarantee.
Q4: is there any numerical results for image tasks?
Yes. We report numerical image generation results on ImageNet-1K search, compositional alignment (GenAI-Bench prompts) tasks, and quantity-aware alignment (T2I-CompBench++ prompts) tasks, against DTS, FKS, DAS, and MFM, as functions of both NFE and feedback budget (Figs. 3, 10–12). We report additional quantitative ablation study results, e.g., BASE vs UCT in Fig. 5, impact of BSS in Fig. 6, and impact of dynamic transition steps in Fig. 7.
While these results are illustrated graphically in the main text, in response to the reviewer's comment, we have also compiled the corresponding numerical values into tables for both NFEs and feedback budgets of 100, 300, and 500. Each entry reports the mean and standard error computed across 5 random seeds, and these new tables are included in Appendix U.
ImageReward results for search experiments (NFE).
| Method | 100 NFE | 300 NFE | 500 NFE |
|---|---|---|---|
| DAS | -2.403 ± 0.072 | -2.141 ± 0.087 | -1.663 ± 0.091 |
| FKS | -2.243 ± 0.127 | -2.185 ± 0.106 | -1.788 ± 0.087 |
| DTS | -1.544 ± 0.153 | -1.585 ± 0.121 | -1.342 ± 0.113 |
| BFMT | 0.336 ± 0.053 | 0.592 ± 0.035 | 0.694 ± 0.020 |
ImageReward results for search experiments (feedback budget).
| Method | 100 budgets | 300 budgets | 500 budgets |
|---|---|---|---|
| DAS | -2.234 ± 0.083 | -1.874 ± 0.077 | -1.345 ± 0.079 |
| FKS | -2.183 ± 0.092 | -1.638 ± 0.087 | -1.540 ± 0.073 |
| DTS | -1.346 ± 0.095 | -0.332 ± 0.083 | -0.149 ± 0.069 |
| BFMT | 0.336 ± 0.053 | 0.592 ± 0.035 | 0.694 ± 0.020 |
ImageReward results for alignment experiments (NFE).
| Method | 100 NFE | 300 NFE | 500 NFE |
|---|---|---|---|
| DAS | -1.037 ± 0.063 | -0.233 ± 0.066 | 0.204 ± 0.058 |
| FKS | -0.974 ± 0.052 | 0.279 ± 0.077 | 0.330 ± 0.067 |
| DTS | 0.408 ± 0.084 | 0.587 ± 0.057 | 0.705 ± 0.070 |
| BFMT | 1.597 ± 0.012 | 1.725 ± 0.007 | 1.789 ± 0.005 |
ImageReward results for alignment experiments (feedback budget).
| Method | 100 budgets | 300 budgets | 500 budgets |
|---|---|---|---|
| DAS | 0.217 ± 0.036 | 0.567 ± 0.041 | 0.980 ± 0.027 |
| FKS | 0.343 ± 0.029 | 0.375 ± 0.033 | 1.037 ± 0.031 |
| DTS | 0.704 ± 0.033 | 0.836 ± 0.040 | 1.240 ± 0.021 |
| BFMT | 1.597 ± 0.012 | 1.725 ± 0.007 | 1.789 ± 0.005 |
Q5: how is the scaling law of the proposed method, like for very difficult math/code tasks or finding a counter case for difficult math problem.
Thank you for the question! We agree that exploring scaling behavior on complex reasoning tasks, such as finding counterexamples for challenging mathematical problems, is an exciting direction. The core motivation of this work is to establish a principled, computationally efficient foundation for budget-constrained tree sampling. Because BFMT is designed without domain-specific assumptions, we evaluated it across two diverse high-dimensional settings (continuous image generation and discrete molecule design), where it consistently demonstrated strong effectiveness. We look forward to investigating BFMT in these demanding math and language reasoning domains in future work.
thx for rbt
thx for your rbt, this work do have some contribution, but the experiments are still a bit weak to me. tend to keep current rating.
Thanks for recognizing the contribution of the paper. However, we would greatly appreciate if you could point out which aspects of our experiments you feel remain insufficient, as we are eager to address any remaining reservations while the discussion window remains open.
Response to Reviewer m4eb (Part1: W1 to W7, Q1)
We thank m4eb for the detailed feedback. We are pleased that Reviewer m4eb finds the problem important and the theoretical results strong. Below, we clarify all the raised concerns.
W1: do not use underlines in the title. do not use colors in the main paper. too many color using for texts and formulations! make this paper looks informal. The overall writing style is a bit strange, like a teaching note in top US university (text box using etc).
We thank the reviewer for the feedback regarding the visual presentation and style. Following your suggestions, we have revised the manuscript accordingly: (a) removed all non-standard colors from the text and mathematical formulations; (b) removed the background colors from text boxes; and (c) removed the underline from the title.
W2: for "Budget-Aware Node Selection", is there some theoretical guarantee?
Thanks for the question. Budget-aware node selection is designed for the finite-budget regime. UCT's exploration bonus is calibrated for an unbounded horizon and has no notion of a depleting budget. BASE addresses this directly by tying the exploitation strength to the remaining budget. It explores broadly when resources are plentiful and concentrates on high-value subtrees as the budget runs out. While it does not have a strict guarantee, Fig. 5 shows that this yields consistently higher reward than UCT at every feedback budget we test.
W3: line 239, Starting → starting
Thanks for catching this. We have fixed this in the updated version.
W4: too many descriptive words, it is recommended to use some pseudo codes. can not follow very well.
We appreciate your suggestion. We agree that including pseudo-code makes the approach much easier to follow. Accordingly, we have added pseudo-code to Appendix Q in the revised manuscript.
W5: QED, SA attributes are too easy to attain in the python rdk toolkit, will them really represent the true merit of a mol. how far is the designed mol. from real world application like drug design.
We thank the reviewer for raising this point. BFMT is a general-purpose, reward-agnostic sampler for feedback-efficient sampling; the molecular experiment is intended to show that it carries over from continuous (image) to discrete (molecular) generation without modification. QED, SA and their composition are standard and intuitive objectives for benchmarking molecular generation, in a discrete-data domain that complements our image experiments.
That said, we agree that a more application-specific objective strengthens the evaluation. Following the reviewer's suggestion, we evaluated BFMT on a Vina docking-score task, a considerably more demanding objective. For this task, we selected protein 4PXX (human carbonic anhydrase II), a well-characterized protein target with a structurally defined binding site and known small-molecule inhibitors, making it a suitable benchmark for docking-guided molecular generation. We compared CFM and BFMT on this task, steering both models towards generating molecules with more favorable (i.e., lower) docking scores, which may indicate stronger binding affinity to the target protein. BFMT improves over CFM under the same feedback budget, as reported in the table below and the density figure in the Appendix. We have added these results and the corresponding discussion to the revised manuscript (see Appendix T).
Table: Protein 4PXX docking experiments (lower is better).
W6: position of related works is a bit strange.
Thank you for the helpful feedback regarding the structure. While we placed the related work section after the experiments to maintain a continuous narrative flowing directly from the introduction's motivation into the methodology, we completely agree that readability is paramount. We would be very happy to move the related work section before the method section in the final manuscript if the reviewer feels it improves the flow for the reader.
W7: too many contributions. it is better to use three to summarize them.
Thank you for the suggestion. Accordingly, we have restructured the contributions into three distinct bullet points in the updated manuscript to improve readability.
Q1: will the proposed UCT tree is proved to find the global optimal?
The proposed BFMT tree sampler guarantees convergence in total variation distance toward the target optimal policy rather than strict global optimality. We have stated this distinction explicitly in the revised manuscript (see Lines 270-271).