- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper improves a two-step graph generation process (LG-Flow) where the first step encodes a graph into node-only latent space with an auto-encoder and the second step generates latent space samples, where during inference the second step-generated samples are fed into the decoder part of the auto-encoder. The specific improvement is their auto-encoder mechanism captures non-adjacent dependencies better. Empirically, they show competitive performance at substantial reductions in compute requirements at inference. They further make theoretical statements on error amplification.
Critical strengths
- Clearly articulated
- Strong empirical results
Critical weaknesses
- Missing SOTA baseline: GraphBSI [1] outperforms GRAFT in several key metrics e.g. on GuacaMol and MOSES.
- The novelty is narrow: An optimization to the autoencoder and a bit of theory.
[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 ablating the performance like in Table 5 but using LG-Flow's encoder with your decoder and your encoder with LG-Flow's decoder? This would isolate performance gains.
4 comments
Response to Reviewer cQ2v (Part 2): Contributions and Cross-Ablation
(W2) Contribution beyond an Autoencoder Modification and Theoretical Interpretation
"The novelty is narrow: An optimization to the autoencoder and a bit of theory."
We appreciate the reviewer’s concern and have revised the manuscript to make our conceptual and technical advances over prior node-latent work (such as LG-Flow) more explicit. Rather than an isolated autoencoder tweak plus standalone theory, GRAFT introduces a tightly coupled framework that resolves key limitations of prior node-latent generators on strict structural benchmarks and large graphs.
First, relational field construction resolves a fundamental representational bottleneck in node-only compression. Prior node-latent methods (e.g., LG-Flow) fail to preserve exact multi-hop topology when compressing edges into node vectors, yielding 0.00% exact graph reconstruction on both SBM and Protein. GRAFT overcomes this by coupling multi-level relational encoding with contextual neighbor-aware decoding (see Reviewer QAQr, Q2.2). As demonstrated by the cross-swapping ablation in Q1 (Table R7), neither the encoder nor the decoder alone suffices; their synergy boosts exact reconstruction from 0.00% to 90.63% on SBM and 93.75% on Protein, making high-precision node-only generation viable.
Second, our theoretical analysis identifies and quantifies a critical failure mode in two-stage node-field generation: transport error amplification. Even with a near-perfect Stage-I autoencoder, Stage-II must generate continuous node fields imperfectly via ODE integration. Proposition 1 characterizes how small terminal transport perturbations in the node field can propagate into decoded relational errors through the relational decoder Jacobian, including their dependence on graph size. We further examine this phenomenon empirically using real terminal transport errors on Protein (Fig. 4).
Third, this error-amplification analysis motivates our investigation of Stage-II self-conditioning to stabilize relational trajectories. Because decoded edges are sensitive to endpoint perturbations (Proposition 1), feeding back the estimated clean node field during Flow transport can promote earlier stabilization of the predicted relational structure, as supported by the reduced relational drift in Fig. 5(d). Using the same self-conditioning-trained checkpoint, enabling inference-time feedback reduces the Protein generation Ratio by nearly 3× (from 14.75 to 5.10, Table 6).
Together, these contributions connect relational field construction, error-amplification analysis, and self-conditioned transport. Their scalability is further evaluated on Point Clouds (Reviewer QAQr, W1).
(Q1) Cross-Swapping GRAFT and LG-Flow Encoders and Decoders
"using LG-Flow's encoder with your decoder and your encoder with LG-Flow's decoder?"
"This would isolate performance gains."
Thank you for proposing a direct way to separate the encoder and decoder contributions. To isolate the contributions of the encoder and decoder, we conducted cross-component ablations on SBM and Protein, combining LG-Flow (L) and GRAFT (G) components under the same target training-step budget (98K for SBM and 200K for Protein), using a shared 32-dimensional latent space and reconstruction objective.
Table R7: Stage-I encoder–decoder cross-ablation.
| Dataset | Encoder | Decoder | Exact ↑ | Edge F1 ↑ |
|---|---|---|---|---|
| SBM | L | L | 0.00% | 73.86% |
| SBM | L | G | 0.00% | 93.12% |
| SBM | G | L | 6.25% | 96.81% |
| SBM | G | G | 90.63% | 99.95% |
| Protein | L | L | 0.00% | 93.63% |
| Protein | L | G | 57.03% | 99.83% |
| Protein | G | L | 52.34% | 99.51% |
| Protein | G | G | 93.75% | 99.86% |
L: LG-Flow; G: GRAFT.
On Protein, replacing either component substantially improves reconstruction, while combining both achieves 93.75% exact reconstruction. On SBM, individual replacements improve edge-level accuracy, but the full GRAFT architecture achieves substantially higher exact reconstruction. These results demonstrate the complementary contributions of the relational encoder and decoder.
Thank you for highlighting the missing baselines and additional ablations. I will raise the score to 3.
Response to Follow-up Comments
We sincerely thank the reviewer for carefully reconsidering our rebuttal and additional experimental results. We greatly appreciate your constructive suggestions, which have helped us strengthen the baseline comparisons and better clarify the contributions of our relational encoder and decoder.
Thank you again for your time and thoughtful assessment.
Best regards,
The Authors
Response to Reviewer cQ2v (Part 1): Comparison with GraphBSI
Thank you for your careful review and for recognizing the clarity of the presentation and the empirical results. We appreciate your suggestions for adding a stronger baseline and isolating the contributions of the relational encoder and decoder.
(W1) Comparison with GraphBSI on GuacaMol and MOSES
Thank you for identifying GraphBSI as an important baseline for these molecular benchmarks. We apologize for its omission from our original comparisons. Following this suggestion, we evaluated the official GraphBSI checkpoints on MOSES and GuacaMol to provide a comprehensive comparison of both generation quality and computational scalability.
(1) Generation Quality: Complementary Strengths in Local Validity vs. Global Distributional Fidelity
We evaluated both methods using the same molecular evaluation toolkit, generating 10,000 molecules per configuration with 100 network function evaluations (NFEs). For GraphBSI, we evaluated both Euler–Maruyama (EM) and Ornstein–Uhlenbeck (OU) sampling.
Table R6(a): Molecular generation quality on MOSES (100 NFEs).
Table R6(b): Molecular generation quality on GuacaMol (100 NFEs).
Table R6(c): Sampling time per graph and estimated cost of generating 10,000 molecules (100 NFEs; lower is better).
Runtime is measured on the same RTX 4090 GPU with batch size 32, FP32 precision, and 100 network evaluations.
As shown in Tables R6(a) and R6(b), the comparison reveals a clear, fundamental trade-off between local syntactic validity and global distributional fidelity: while GraphBSI achieves higher syntactic Validity and VUN, GRAFT substantially outperforms GraphBSI on the primary distributional metrics—reducing FCD by 22.6%–25.7% on MOSES (0.7987 vs. 1.0315/1.0751) and improving FCD Score by +7.67 to +10.03 points (84.04 vs. 74.01/76.37) and KL Score by +3.73 to +5.42 points (97.69 vs. 92.27/93.96) on GuacaMol (and further reaching 88.16 FCD Score at 500 NFEs in Table R3).
This trade-off stems directly from how each paradigm represents graph structure. GraphBSI iteratively refines categorical distributions over explicit atom and bond types at every step, making it easy to satisfy local valency rules (Validity), whereas matching complex global property distributions (FCD and KL) in high-dimensional discrete space is more challenging. In contrast, GRAFT performs continuous straight-line Flow Matching over compact relational node fields, enabling markedly stronger global distribution alignment (FCD and KL) across chemical and physicochemical properties. Although atom types, formal charges, hydrogen counts, aromaticity, and bond relations are supervised during Stage-I reconstruction, strict valency rules are not explicitly constrained during Stage-II transport or single-pass decoding. Incorporating chemistry-aware valency constraints into relational decoding is a natural extension to further boost validity while retaining GRAFT's strong distributional fidelity and speed.
(2) Computational Efficiency: Practical Benefits for Large-Scale Molecular Sampling
More importantly, comparing runtime scaling from MOSES to the larger molecules in GuacaMol highlights the architectural advantage of GRAFT's O(n) node-only transport: whereas GRAFT's per-graph sampling time increases by only 1.6× (0.0198s → 0.0324s), GraphBSI's runtime surges by 6.1× (0.1301s → 0.7898s) because it must maintain and update dense O(n2) edge states at every sampling step. This advantage is critical in practice, as standard molecular benchmarks require generating 10,000 or more molecules per evaluation. Extrapolating from the measured batch throughput, generating 10,000 molecules takes 3.3 minutes with GRAFT versus 21.7 minutes with GraphBSI on MOSES, and 5.4 minutes versus 131.6 minutes (over 2.1 hours) on GuacaMol. We have added these comparisons and discussions to the revised manuscript.
[1] Petersen, O., Kollovieh, M., Lienen, M., and Günnemann, S. Discrete Bayesian Sample Inference for Graph Generation. ICLR, 2026.