- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
Satisfying objective thresholds in multi-objective sampling is a difficult problem since an acceptable or feasible object is only achieved when all objectives pass their performance thresholds. In order to improve the diverse sampling of feasible objects in these multi-objective setting, this paper proposes a post-hoc sampling method whereby multiple GFlowNets (trained with different rewards) are composed in such a way to avoid sampling below-threshold actions. Threshold violations are evaluated in a clever way: by using a property of GFlowNets with squared and unsquared rewards! This is an interesting solution to the problem of thresholded sampling because it allows one to change the thresholds without re-training a model, thereby allowing for more or less greedy sampling with just two GFlowNets. The experimental results in the hypergrid environment are quite interesting, demonstrating that threshold-guided sampling with GFlowNets is the only work capable of generating samples within a threshold area. In a scientific discovery task with a variable number of objectives, the proposed method often outperforms baselines, albeit by a small margin with a smaller number of objectives.
Critical strengths
The paper motivates the problem well, making clear the desire to sample according to multiple objectives. The empirical results are especially interesting as they draw a sharp distinction between the proposed method and prior work.
Critical weaknesses
First, I feel that while the problem is well-motivated and somewhat placed into the context of prior work in the introduction, the writing in Section 2 made it unfortunately extraordinarily difficult to understand the actual substance of the work. After much reading, I finally understood the method to essentially be sampling with penalisations on probabilty mass according to the collective below-thresholdness of each action. A cleaner presentation would have substantially aided this understanding, especially if the related works section went through prior approaches and how they do a similar thing, and how your method differs. The writing alone is a major factor in my decision to reject the paper.
Second, I am not convinced that sections 2.2 and 2.3 are actually presenting anything new. Section 2.2: it is fine to show the training loss and state that you're training a neural network with two heads, but the section feels almost torturous with unnecessary definitions of terms that never re-appear. The only thing that Section 2.2 needed to say was that the backward policy was the same between the two networks. This sets up the result of Section 2.3, which is already proven in the GFlowNet foundation paper in Appendix D (or at least something very similar). This citation is never produced, nor is it ever stated that this is an already known property of squared reward GFlowNets against unsquared reward GFlowNets. In addition, the proof of this proposition need much more detail, in addition to the citation to the prior work.
EDIT: After rebuttal, I think the manuscrit has improved somewhat, but still not enough for me to recommend acceptance.
Questions for authors
- I wonder whether the increased number of networks improves performance, and whether a larger single GFlowNet, or larger networks in MO-GFN would produce similar results, given that you seem to need substantially more parameters for a given task?
- From Figure 2 in the main body and Figure 6 in the appendix it seems that the mu-GFN with theta=0.6 would best-recover the optimal sampling region of the mu-GFN with theta=0.4. Why wouldn’t it be optimal in general to deploy with more restrictive-than-necessary thresholds when they seem to be better at fitting into the space?
- From Section 3.2 and 3.3, it seems that GFN excels really when there are more objectives. Please provide some intuitions for why this may be the case, and how MO-GFN, for instance, is unable to scale to the same extent.
4 comments
Response to Reviewer 5WGr : Q2 and Q3
Q2 Stricter guidance cutoffs
Thank you for raising this point. In this grid, the feasible set is empty at cutoff 0.6, so the corresponding panel cannot show samples that meet the requested constraints. We mentioned this in the figure caption and Section 3.1, but we should have explained its implications more clearly in the main text. We will clarify this when discussing the threshold progression.
Table 5WGr-3. Exact feasible-set sizes on the 16 × 16 grid. Both objectives use the same cutoff.
| Evaluation cutoff | 0.3 | 0.4 | 0.5 | 0.6 |
|---|---|---|---|---|
| Number of jointly feasible terminal states | 47 | 17 | 3 | 0 |
This does not rule out the reviewer's suggestion that stricter guidance could improve sampling at a lower, fixed evaluation cutoff. Our molecular sensitivity study addresses that separate question.
Table 5WGr-4. Guidance sensitivity on JNK3 + GSK3β. Both evaluation cutoffs remain 0.5 and λ remains 1. The same five checkpoints are reused, with 5,000 draws per seed and requested cutoff. Entries are means ± SD.
| Requested score cutoff | SR_unique ↑ |
|---|---|
| 0.5 | 0.0055 ± 0.0009 |
| 0.6 | 0.0045 ± 0.0005 |
| 0.7 | 0.0046 ± 0.0008 |
| 0.8 | 0.0050 ± 0.0009 |
| 0.9 | 0.0052 ± 0.0013 |
The observed means are not monotonic. They do not establish significance for individual differences, but do not support a general prescription to use more restrictive cutoffs. Raising a request can change the active shortfall penalties and the concentration of the sampling distribution.
In the main molecular comparison, requested score cutoffs equal evaluation cutoffs, with 0.5 for JNK3, GSK3β, and SEH, 0.6 for QED, and 0.7 for SA. Each is converted to reward units separately. This alignment does not apply to sensitivity experiments such as Table 5WGr-4. We will also correct the statement that λ was fixed before the experiments. The task-specific strengths were selected through exploratory evaluation, and the revised protocol will report the explored settings and sensitivity results rather than describe the selection rule as independently validated.
Finally, the illustrated grid sweep uses the linear gate. An empty feasible set does not imply that every action estimate lies below every cutoff, so we will not attribute the 0.6 panel to complete cutoff cancellation without checking that condition. The full log-shortfall sampler has now been evaluated separately, as reported in our response to PnJS.
Q3 Behavior as the number of objectives increases
The mechanism motivating μGFN is that an aggregate reward can improve while an individual requirement remains unmet. Separate shortfall penalties retain a signal for each predicted deficit, while capping stops penalizing an objective whose estimate meets its cutoff. This can help coordinate multiple requirements, but it is not a proof of an increasing advantage with objective count.
The four-objective main result still corresponds to approximately three distinct feasible molecules per 5,000 draws. Moreover, uncapped guidance has higher mean unique success on that task, 0.0011 versus 0.0006. We will retain these qualifications. The separately established reuse benefit is that the trained objective models can be recombined across subsets without further objective-model training.
Thank you for addressing these weaknesses and answering my questions. After these responses, I am a little more satisfied that your method is effective and interesting, at least experimentally. It does seem that this composition of different GFlowNets is a useful technique. That said, having read over the revised methods section (Section 2), I cannot say that the writing or understandability has improved significantly. Thus, while I will increase my score, I still cannot fully support publication.
When updating your manuscript, please highlight changes with red text or a yellow or orange highlight, this makes it a lot easier to see what you've changed. Please try to improve the writing and motivation, and also strongly consider including a background section after the introduction. There are a lot of missing steps that would have greatly improved readability.
Thank you for the follow-up and for reconsidering your score.
We need to apologize for a confusion on our side: at the time of your comment, the revised PDF had not yet been uploaded, so the Section 2 you read was the original submission. Our earlier response described the changes but did not make this clear. The revised manuscript is now available, with all changes marked in red.
We would be grateful if you could take another look at the revised version. If any specific step remains unclear, we will revise it further within the discussion period.
Response to Reviewer 5WGr : Weaknesses and Q1
Thank you for the detailed feedback. We agree that the presentation made the sampling mechanism harder to understand than necessary and did not sufficiently distinguish the guidance contribution from the underlying flow-moment construction. We address these points first, followed by the three questions.
Weaknesses: Presentation and relationship to prior work
The main idea is to compose objective-specific flows and reduce the probability of actions whose estimated continuation rewards fall below requested cutoffs. We will reorganize Section 2 around this sampling rule, define its quantities before use, and move the detailed training construction and proof to the appendix. The main text will retain the shared-backward-policy condition and explain precisely which policy defines each reward estimate.
We also agree that reward-moment extraction has prior foundations. Appendix D of GFlowNet Foundations discusses downstream reward estimation using squared-reward and reward flows. We will explicitly credit this connection and distinguish its conditioning from continuation under an objective's forward policy. We will not present the general flow-moment principle as a new contribution.
Our contribution is the use of objective-wise continuation estimates in a root-normalized composition with capped relative-shortfall penalties, allowing requests to change at inference time. The cap removes an objective's penalty once its estimate reaches its cutoff, while an uncapped log-shortfall rule loses its cutoff dependence after action normalization. This distinction establishes a mechanism for responding to requests, not a guarantee of higher feasible yield or exact sampling from the feasible set.
Q1 Parameter-matched baselines
We trained a larger MOGFN-PC model to match the total trainable parameter count of the two MuDBPB models used for JNK3 + GSK3β. Each MuDBPB model has 1,525,053 parameters, so the deployed two-objective system contains 3,050,106 trainable parameters in total. MOGFN-PC with embedding width 416 has 3,041,066 parameters, a difference of approximately 0.30%.
Table 5WGr-1. Total-parameter comparison on JNK3 + GSK3β. All rows use five seeds and 5,000 generated molecules per seed. Training uses 10,000 iterations and batch size 16 per model. Values are means ± across-seed SD. SR_unique counts distinct feasible molecules divided by all 5,000 draws. The μGFN row is reproduced from the main manuscript table; width 416 is the additional experiment.
Widening MOGFN-PC did not improve mean unique success under this training protocol. We do not interpret the small difference between μGFN and the width-416 baseline as a demonstrated statistically significant advantage, or conclude that capacity is irrelevant. Retuning or longer training of the larger baseline could change the result.
The parameter comparison also distinguishes training from inference. μGFN's backward-policy heads are trained but not evaluated during sampling, leaving 2,601,896 active inference parameters across the two models. An additional width-384 baseline matches this quantity with 2,610,538 parameters. We report it as a supplementary check rather than rely on its lower performance for the capacity argument.
Table 5WGr-2. Supplementary inference-parameter comparison. The full five-seed row retains the unstable run. Its exclusion is shown only as a sensitivity analysis.
Parameter matching does not imply matching every resource. For the molecular training protocol, each objective receives 160,000 score evaluations in either approach, while μGFN trains a separate network for each objective. We will distinguish oracle evaluations, total optimization steps, parameter counts, and model reuse rather than describe all resources as equal.