- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies graph flow matching by considering graph symmetry. Since any graph can be mapped to multiple equally valid edge feature matrices, the authors introduce a distance metric over the graphs in the quotient space of feature matrices. Showing that the quotient space metric can be defined in terms of representative feature matrix, authors propose two inner alignment methods that selects representative matrix—GW and BoA. Outer alignment further matches mini-batch samples using the metric computed by the inner alignment methods, which helps straightening flow paths. Experiments were conducted on cycle-graphs for continuous targets and on two molecular graphs for categorical targets.
Critical strengths
The explicit decomposition into node- and graph-level pairings provides a conceptual framework for graph flow matching.
Critical weaknesses
Presentation
- The paper is overly complicated and notation-heavy compared to the presented ideas.
- Some notations are used without proper definitions, so I can only infer the meaning of the symbols from the context. E.g. for orthogonal group, and for the channel dimensions, or for permuted feature matrices, etc.
- The paper does not follow formatting instructions, such as "Paragraphs are separated by 1/2 line space." The fontsize in the table is too small.
- Limitation of the paper is not discussed.
- Related work is deferred to the Appendix, making difficult to position the paper within broader context. The related work section is also omits several graph generative paradigms.
Quality of experiments
- Experimental evaluation is relatively weak. Cycle-graphs, while illustrative, is too simple, and Table 1 includes no baselines. Table 2 also compares within variants of the proposed method.
- Table 3 only compares flow matching-based graph generative methods, omitting other generative paradigms. For example, GEEL [1] achieves better validity and FCD on both QM9 and Zinc250k datasets. While pushing the boundaries of flow matching may be meaningful, the authors do not justify this choice.
Significance
- I think the originality of the paper is somewhat limited, as the outer alignment corresponds to minibatch OT, so the paper's novelty appears to lie primarily in the inner alignment formulation and its evaluation.
- While feasible for small graphs, the compute cost could become a bottleneck for large graphs, as inner alignment step is required for each pair. As Zinc250k contains graphs with up to nodes, the authors could evaluate their model on larger graphs.
[1] Jang et al., A Simple and Scalable Representation for Graph Generation, ICLR, 2024.
Questions for authors
Can you provide accessible summary of your work, the significance of your paper, and why it matters for the broader graph generative models?
4 comments
Follow-up
Dear Reviewer,
As the discussion period is coming to an end, we would greatly appreciate your feedback on our response and updated manuscript.
Thank you for your time!
I thank the authors for their rebuttal. I appreciate the extended experiments (3D molecules) and the new discussion on computational cost. However, I am not convinced that the method is 'competitive with recent graph generators across paradigms.' If the authors believe that evaluation protocols differ across methods, they should use more standardized benchmarks, such as GuacaMol and MOSES; while I found results on GuacaMol in Table 2, they are missing from Table 3. While the paper improves upon CatFlow (which offers transferable insights), the proposed method remains limited in scope to graph generation. The authors would benefit from more thorough experiments and a clearer presentation of the method's advantages compared to more general generative models.
We thank the reviewer for the follow-up and for acknowledging the 3D experiments and compute discussion. In response, we have just uploaded a further updated version of the manuscript and kindly refer the reviewer to this latest version.
GuacaMol in Tab. 3. We had already started the GuacaMol experiments at the beginning of the rebuttal period and have now added full-budget results to Tab. 3 of the updated manuscript, evaluated with the official GuacaMol distribution-learning suite (normalized FCD score):
| Method | Paradigm | Validity ↑ | FCD score ↑ |
|---|---|---|---|
| DiGress | Discrete diffusion | 85.2 | 68.0 |
| DeFoG | Discrete flow matching | 99.0 | 73.8 |
| GEEL | Autoregressive | 88.2 | 71.5 |
| AutoGraph | Autoregressive | 91.6 | 79.2 |
| CatFlow (our impl.) | Categorical flow matching | 98.9 | 71.8 |
| GW-CatFlow (ours) | Categorical flow matching | 98.6 | 78.3 |
Since all methods use the same official evaluation suite, these results provide a standardized comparison. GW-CatFlow outperforms all methods in FCD score except AutoGraph, which has substantially lower validity (91.6 vs. 98.6). Due to discussion-period time constraints, both our models were trained for only 100 epochs, leaving additional training-budget scaling unexplored.
Competitiveness. We believe our claim is supported across benchmarks. On ZINC250k, GW-CatFlow reaches the second-best FCD in Tab. 3 (0.966), behind only GEEL and ahead of all diffusion and flow models (VBFN 1.307, DeFoG 1.425, GGFlow 1.455, DiGress 3.482). Moreover, App. G (Tab. 8) verifies that these gains are not an artifact of the evaluation protocol: GW remains ahead of Random under all tested ZINC250k conventions (charge handling, reference-set size), and the dominant reporting difference, our smaller PyG test set, biases our absolute FCD upward (by ≈0.22), i.e., against us. On GuacaMol, it achieves the best FCD score among diffusion and flow models in our comparison and is within 0.9 points of autoregressive AutoGraph, with clearly higher validity. Moreover, across datasets and tasks, we consistently demonstrate the benefits of quadratic alignment for both standard and categorical graph flow matching in Euclidean space.
Scope. We are confused about the statement that we are "limited in scope to graph generation". Graph generation is the explicit focus of our paper, and it is a large and important field in its own right (molecular design, materials, networks). Its central difficulty is node-permutation symmetry, which is exactly what our coupling addresses. Our method also extends beyond pure permutations to graphs in 3D space, as shown by the joint permutation-rotation alignment on 3D QM9 (Sec. 5.3).
Experimental scope. Our experiments are deliberately controlled: within each coupling comparison, architecture, training, and seeds are kept identical, and results are averaged over three evaluations. We cover continuous targets (cycle graphs, conditional and unconditional SBM), categorical targets (QM9, ZINC250k, GuacaMol), and 3D molecules. For context, 7 of the 11 published baselines in Tab. 3 (GraphAF, MoFlow, GDSS, CatFlow, CFM-CSD, GGFlow, VBFN) do not seem to report GuacaMol results in their original papers.
We hope the additional standardized benchmark addresses the remaining concerns. Given the breadth of experiments and competitive results, we find it difficult to understand which specific shortcomings still justify the current score. If specific concerns remain, we would appreciate clarification. Otherwise, we would be grateful if the reviewer reconsidered their assessment.
Response
We thank the reviewer for the detailed feedback and for appreciating the decomposition into node- and graph-level pairings. We respectfully disagree with some of the assessments and clarify them below. Please also see our general comment. Sections, figures and tables refer to our updated manuscript.
Q: Accessible summary and novelty
Graphs have no node order, so flow matching must decide which source node is interpolated to which target node. When graphs are interpolated in their tensor representation space (e.g. one-hot node and edge features), doing this correctly requires a quadratic assignment over edges and features. To our knowledge, no existing graph flow model accounts for this geometry, and we are the first to connect it to standard optimal transport on the quotient space. This results in equivariant flow matching with straighter paths, cheaper and better transport estimators (Prop. 4.1), and improved few-step generation.
Presentation
Quality of experiments
Significance
If our answers address your concerns, we would be grateful if you considered raising your score.
[1] Jang et al. A Simple and Scalable Representation for Graph Generation.