- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Contributions:
- Introduce a novel two-step generative model for graphs: Step one generates a draft graph together with an embedding, step 2 refines the draft with help of the embedding. Step one applies a VAE with graphons, step two uses flow matching
- Empirically demonstrate competitive performance on molecule + synthetic graph generation benchmarks
Critical strengths
- Novel approach for graph generation. I believe that the two-step graph generation process is an interesting pattern that can be applied in lots of variations
- Strong empirical results
Critical weaknesses
The empirical results expose substantial gaps that make the empirical performance hard to judge:
- Key metrics are missing: GuacaMol misses FCD, Moses misses validity, filters, and FCD.
- Missing baseline: A current SOTA model, GraphBSI [1], is missing from empirical results
- The ablations do not sufficiently uncover how much performance can be attributed to each step
Also, the clarity could be improved.
[1] Petersen, Ole, et al. "Discrete Bayesian Sample Inference for Graph Generation." International Conference on Learning Representations. Vol. 2026. 2026.
Questions for authors
- Would you mind adding the missing SOTA baseline, GraphBSI [1] as well as the missing key molecular metrics?
- Please clarify your contributions!
- The method has a lot of sub-systems, and the paper does not sufficiently evaluate the contribution of each of them. In particular, I am interested in:
- The performance of your flow matching model without graphon priors but with a non-learned prior
- The performance of your flow matching model without conditioning on the embedding z
- The performance of the graphon samples themselves without flow matching refinement
- What happens when you swap out different parts of the system? E.g. use discrete diffusion, BFNs, or BSI for the refinement step instead of flow matching? Is there something that makes the graphons/VAE/flow matching combination especially powerful?
3 comments
Thank you for clarifying the contributions and being more transparent regarding empirical results! I will raise the score.
thank you
Esteemed Reviewer,
Thank you for such a quick reply, engaging with our work and helping to make it better. Rest assured we will implement all requested improvements.
Meantime, kindly let us know if there is anything else we can answer or improve.
Best regards,
Authors
We sincerely appreciate the reviewer's thoughtful comments and constructive feedback.
Q1. Would you mind adding the missing SOTA baseline, GraphBSI [1] as well as the missing key molecular metrics?
We have updated Table 2 in the revised manuscript to include the previously missing metrics and GraphBSI baseline.
Q2. Please clarify your contributions.
We would like to clarify the main contributions of GraphonFlow:
Unlike existing graphon-based methods that primarily estimate graphons for graph reconstruction, or flow-based approaches such as Flowette that employ predefined structural priors, GraphonFlow learns a distribution of graph-specific graphons conditioned on graph-level latent representations (Sec. 3.1). The latent-conditioned graphon serves two complementary purposes: it acts as a probabilistic Bernoulli decoder for adjacency reconstruction during Stage 1 and provides a learned structural source distribution for continuous-time flow matching during Stage 2. This allows the source distribution to adapt to connectivity patterns observed in the training data, rather than relying on a manually specified graphon or unstructured noise.
Graphon reconstruction is challenging because equivalent graphs can be represented by different node permutations, producing inconsistent reconstruction targets. We address this through canonical graph labelling with property-aware vertex colouring, establishing a consistent coordinate representation for learning graphon surfaces (Sec. 3.1 and Appendix C). Unlike explicit graph-to-graph optimal transport alignment, this approach does not require learning additional alignment parameters or computing pairwise source–target graph matching during flow training. The controlled canonicalisation ablations in Table 8 demonstrate the contribution of consistent structural supervision.
GraphonFlow introduces a two-stage generative framework that learns a latent-conditioned graphon as a probabilistic structural source, followed by flow matching to refine the generated graphs towards the target distribution (Secs. 3.1–3.2). After learning the graphon-based source, we freeze the Stage 1 model and train a conditional velocity field that jointly evolves adjacency, node attributes, and edge attributes. Unlike approaches that use graphons solely as final graph decoders, GraphonFlow uses the learned graphon to initialise generation, while flow matching transports the resulting graph states towards the target distribution. The controlled source-prior ablations (Table 7) demonstrate that latent-conditioned graphon sources outperform Erdos-Renyi and unconditional graphon sources under the same flow-matching framework. Furthermore, Table 9 demonstrates the benefits of sequential two-stage training over joint optimisation.
We introduce complementary connectivity-aware objectives at the two learning stages (Sec. 3.3 and Appendix G.5). The graphon-level connectivity regulariser encourages structurally coherent source graphs, while the spectral objective incorporates algebraic connectivity into flow learning. Together with the graph-aware velocity network and domain-specific constraints, these objectives promote structural fidelity during generation. Their individual contributions are evaluated through the regularisation ablations in Tables 10 and 11.
Overall, our key contribution is not simply combining a graph VAE with flow matching, but learning a graph-dependent probabilistic structural source that is subsequently refined through continuous-time transport. Canonical supervision makes this structural learning permutation-consistent, while connectivity-aware objectives improve the structural properties of the generated graphs. The controlled ablations in Tables 7-11 isolate the roles of these components and support their contributions beyond the overall benchmark comparisons.
Q3. Ablation study.
This comparison is already included in Table 7 (Appendix I.5.1).
This ablation is also included in Table 7, where the unconditional graphon (UG) removes dependence on the graph-level latent variable zg, while retaining the same flow architecture and attribute-generation mechanism.
We have added a controlled ablation in Appendix I.5.7 (Table 13), comparing standalone Stage 1 graphon samples with the complete GraphonFlow framework.
We have added a controlled refinement-swap ablation (Appendix I.5.8, Table 14), replacing Stage 2 FM with a DiGress-style Discrete-Diffusion (DD) model while keeping the learned Stage 1 graphon-VAE fixed.