- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
After a GFlowNet is trained, it is typically deployed as a frozen model to draw a finite number of samples, with the goal of obtaining diverse, high-reward objects. The authors argue that reward-proportional i.i.d. sampling does not fully match this goal, and propose CAS (Capacity-Aware Sampling), which adjusts the frozen sampling policy by reweighting actions according to the sampling history so far.
Critical strengths
The motivation is clear and insightful, and it is the main reason I do not consider this paper a clear reject. The paper identifies a practical but largely overlooked problem in GFlowNet deployment, namely how to sample from a frozen model under a finite budget, whereas most existing work focuses on training.
Critical weaknesses
The readability of the paper is relatively low. The claims are not tied to clear intuition, and some concepts are used before they are clearly defined or described. Much of the content is presented as theorems and propositions, which is fine in itself, but the narrative connecting them is weak, and the link between the theory and the practical algorithm is thin. As a result, I found the paper hard to follow and was left doubting whether this mathematical machinery is necessary to introduce the practical algorithm.
The baselines do not appear to be well tuned (see Q3), and the frozen GFlowNet policies seem to be undertrained (see Q4). Both issues weaken the credibility of CAS's empirical advantage.
Note: The authors do not need to respond to the weaknesses above separately; answers to the questions below are sufficient.
Questions for authors
- The second limitation of standard frozen deployment (i.e., "the same amount of flow can congest a low-capacity state or transition") is confusing, as is Proposition 1. What is the actual cost of congestion at a low-capacity resource? In addition, the term capacity is used frequently before it is defined.
- Lemma 1 justifies the per-step reweighting form, but the penalty κ involves several heuristic design choices and many hyperparameters. For example, why are the soft threshold and the congestion ratio combined via a max? Moreover, with β = 1 the BPR function reduces to a ReLU; why do the authors introduce the BPR form?
- Nucleus sampling is reported in the main text with p = 0.8, whereas Figure 3 seems to suggest that p = 0.5 performs better on 4 of the 5 tasks. In addition, results for p < 0.5 and T < 0.5 are not reported. Could the authors explain these choices?
- The results of standard i.i.d. sampling (particularly on SEHSTR and QM9STR) suggest that the frozen GFlowNet policies may not be well trained: soft thresholding alone accounts for most of the improvement, and lowering the temperature alone improves performance on QM9STR dramatically. Could the authors comment on this?
- Proposition 2 appears to be a standard result. In fact, any support-preserving policy π can be written as the solution of Eq. 10 for some κ (e.g., κ(a) = log P_F(a|s) − log π(a)), so the KL-regularized form does not by itself justify the choice of κ. If κ is not connected to κ† in Lemma 1, what does Proposition 2 add beyond subtracting a heuristic penalty from the logits?
Given the absence of any response from the authors, I am decreasing my score from 2 to 1.