- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
his paper introduces a general framework for mixtures of GFlowNets, in which a component index is sampled before generating an object, and the resulting mixture is trained to match a reward-proportional target distribution. The framework accommodates both continuously indexed and discretely indexed components through a mixed trajectory balance condition.
For continuous indexing, the authors connect random-feature augmentation to improved expressivity and training stability. For discrete indexing, they propose Stratum-Conditioned (SC) GFlowNets, which restrict individual components to subsets of the terminal space defined through object statistics such as length or distance. Components can share a conditional neural network or be trained independently in parallel, with their learned partition functions determining the mixture weights at inference time. The paper also establishes connections to Doob’s h-transform, Subgraph Asynchronous Learning, and Boosted GFlowNets. Experiments across several discrete sampling tasks show improved convergence and exploration with little additional per-step computation.
Critical strengths
S1. Simple and practically appealing method.
SC GFlowNets provide a straightforward mechanism for encouraging exploration of different regions without requiring an auxiliary exploration network or sequentially trained boosters. The shared-network implementation is particularly attractive because it can retain approximately the computational cost of a single sampler.
S2.Useful probabilistic formulation.
The relationship between component rewards , component partition functions, and inference-time mixture weights is clearly motivated. This provides a useful framework for understanding how specialized components can collectively recover the original target distribution.
S3. Broad empirical evaluation.
The experiments cover set generation, Hypergrid, graph generation, sequence generation, and variable selection. The paper also examines alternative partitions, the number of components, and parallel training. Reporting runtime and FLOPs, in addition to training iterations, is relevant to the claimed computational benefits.
S4.Informative connection to conditioned stochastic processes.
The Doob’s h-transform interpretation offers a useful conceptual explanation of SC components as generation processes conditioned on terminal events, even though the transform itself is not used directly for training.
Critical weaknesses
W1. Proposition 5.7 does not establish efficient reachability under the stated assumptions
Equation (6) requires finding an extension satisfying both
\quad \text{and} \quad \psi(s \cup s') \in [a_k, b_k).$$ However, the proof in Appendix H.4 reduces this problem to enumerating possible intersection counts and checking whether $$\xi(n + m) \in [a_k, b_k),$$ without retaining the terminal-feasibility constraint $s \cup s' \in \mathcal{X}$. It also does not establish that the proposed extension is reachable through the allowed transitions. Having only polynomially many possible statistic values does not imply that a valid terminal completion realizing each value can be found or recognized efficiently. Additional assumptions on the terminal space and transition structure appear necessary. Since this proposition supports the claimed tractability of constructing SC action masks, this gap affects an important theoretical justification of the method. The particular experimental environments may still permit efficient masking, but this does not follow from the proposition as currently stated. **W2. The claimed positive spectral shift is not implied by Proposition C.7** The expansion $$H_{\mathrm{TB}} =H_0+\frac{\sigma^2}{2} H_{\mathrm{Reg}}+O(\sigma^4)$$ does not establish that random features increase the Hessian eigenvalues or improve its conditioning. The paper does not prove that $H_{\mathrm{Reg}}$ is positive semidefinite. Moreover, eigenvalues of a sum of symmetric matrices are not generally obtained by adding their eigenvalues componentwise, contrary to the interpretation given in Appendix H.12. Consequently, the claimed theoretical explanation that random features stabilize training through an upward spectral shift is not supported by the current argument. The empirical stability result remains interesting, but the theoretical interpretation needs additional assumptions or substantially weaker wording. **W3. The assumptions of Lemma C.6 are insufficient for its remainder bound** The lemma assumes zero-mean random features with covariance $\sigma^2 I$, whereas its proof additionally uses the assertion that all odd moments vanish. Zero mean alone does not imply vanishing third moments. Obtaining the stated $O(\sigma^4)$ expansion requires further distributional, moment, and smoothness assumptions. Similarly, differentiating an $O(\sigma^4)$ remainder twice with respect to model parameters does not automatically preserve that order without suitable uniform derivative bounds. These technical issues may be repairable, but resolving them would not by itself establish the positive spectral-shift claim above. **W4. The action mask in Example 5.4 appears incorrect as written** The forward transition is masked according to $$p_F^{(k)}(s, s + 1) \propto \mathbb{1} \left[s + 1 \in \mathcal{X}_k\right] \exp(\cdots).$$ For the second and third intervals, the successor of the initial state is outside the selected interval, while termination is also forbidden. Thus, the component would have no valid action at initialization. The mask should instead test whether the target interval remains reachable after the transition, rather than whether the immediate successor already belongs to that interval. This may be a formula error rather than an implementation error, but it needs clarification because this example is central to the explanation of SC sampling. **W5. The experiments do not sufficiently isolate the sources of improvement** SC simultaneously introduces component conditioning, hard reachability masks, separate partition-function parameters, and mass-based component sampling. The current experiments do not clearly establish which mechanisms account for the gains. In particular, comparisons between uniform and active component sampling, and between component-conditioned models with and without target specialization, would strengthen the empirical analysis. Accuracy-versus-wall-clock curves on representative tasks would also more directly support the practical speedup claims than iteration-based convergence curves combined with separate per-step timing measurements.Questions for authors
Q1. Reachability and Proposition 5.7:
How does the proof account for the constraint in Equation (6), as well as reachability through valid transitions? What additional assumptions on the terminal space and state graph are needed, and do they hold in every experimental domain?
Q2. Spectral regularization:
Can the authors establish conditions under which is positive semidefinite and the claimed eigenvalue increase holds? Otherwise, would they revise the spectral-shift claim and distinguish the loss expansion from the empirical observation of improved stability?
Q3. LINES implementation:
How can components move from the initial state under the mask in Example 5.4? Does the implementation check immediate interval membership or future reachability of the interval?
Q4. Expressivity claim:
Does “any target distribution” in Proposition C.5 require assumptions concerning graph-isomorphism invariance or node-label features? How does the cited random-feature GNN universality result establish universality for the specific pairwise action parameterization in Equation (11)?
Q5. Ablations and practical efficiency:
Could the authors provide ablations of active component sampling and component conditioning, together with convergence-versus-wall-clock comparisons against the single-component and boosted baselines?
We thank all reviewers for the feedback and for the engagement throughout the review process. We outline below the main changes we made during the rebuttal, which have helped strengthen our work.
We have brought the comparison against Boosted GFlowNets to the main text and included new experiments showing our method, SC GFlowNets, converges faster than SAL (another mixture-based baseline; Sec. 6, F).
We expanded the discussion on Continuously Indexed GFlowNets, providing an empirical illustration of its universal approximation capabilities in graph-structured tasks (Sec. 4, Fig. 2).
We conducted additional ablation analyses, showing the positive effect of active partition sampling (vs. uniform sampling) and stratum-conditioning (vs. feature augmentation alone) on SC GFlowNets’ performance (Sec. 6, G).
We fixed the observed typos and made explicit assumptions that were previously implicit in a few statements (Sec. 5, Sec. C).
We added comparisons to a recent GFlowNet baseline (Local Search), which also implements an exploration-boosting heuristic, underlining our method’s faster learning convergence (Sec. G, Fig. 33).
We included mode-tracking experiments, which highlight SC GFlowNets’ improved exploratory capabilities (Sec. 6).
To summarize, our work develops an abstract framework for learning a mixture of GFlowNets (Sec. 3), connects it to existing methods (e.g., Sec. 5 and D, Props. D.4, E.4, and F.4), and derives practical learning algorithms from it.
In particular, we introduce SC GFlowNets, establish the conditions for its tractable implementation (Prop. 5.7), its limitations (Prop. 5.6), and its connection to Doob’s h-transform (Remark 5.8, Prop. D.6), and empirically demonstrate it improves upon prior mixture-based approaches in terms of learning convergence, computational cost, and mode discovery (Sec. 6, E, F, G). We also prove that a continuous mixture of GFlowNets is a universal approximator for isomorphism-invariant distributions on edge-additive graph-structured tasks (Sec. 4, Prop. 4.3).