- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes a latent flow matching framework for molecular graph generation using a pretrained graph-level VAE. It further introduces classifier-based validity guidance and property-controlled generation. While the approach shows promising FCD results and reduced flow-model training costs, its methodological novelty is limited, and several experimental weaknesses substantially undermine its claims of efficiency, scalability, and practical effectiveness.
Critical strengths
- The proposed latent generation pipeline is straightforward.
- The method achieves competitive FCD scores, particularly on PubChem16 and PubChem32.
Critical weaknesses
- Limited novelty. The framework largely combines an existing pretrained VAE, standard flow matching, and conventional classifier guidance. The contributions appear primarily incremental rather than conceptually novel.
- Unconvincing scalability claims. On PubChem32, the proposed model achieves only 74.5% validity, substantially below DiGress (99.0%). This directly challenges its claimed effectiveness on larger molecular graphs.
- The reported training costs exclude VAE pretraining, potentially overstating computational advantages. Furthermore, the method is slower than competitive explicit graph generators at comparable low NFE on smaller datasets.
- Missing important baselines and datasets. Comparisons are largely restricted to DiGress and Categorical Flow Maps. The paper doesn't include and compare important latent graph generative approaches, such as LGD, making the claimed advantages insufficiently established.
Questions for authors
Please see the Weaknesses.
3 comments
Rebuttal: Reviewer Bt1a
W3
The reported training costs exclude VAE pretraining, potentially overstating computational advantages. Furthermore, the method is slower than competitive explicit graph generators at comparable low NFE on smaller datasets.
We thank the reviewer for that comment. Regarding the first point, we situate ourselves in applications where a pretrained representation model is readily available. In turn, our training cost therefore focuses any new generation task that could arise, meaning that training any number of generative models upon that latent, guided by any number of properties, would be cheap compare to the need of retraining from scratch a complex explicit generator since the pretrained model is reused as-is (in the same philosophy as BERT-type models for text, whose latent can be used with simple fine tuning for any number of task once trained once).
We understand that this advantage is mitigated in the case where a single generative model is required, and are currently training a VAE from scratch on PubChem16 for 17 hours, which is roughly the training time for DiGress. We will report the results in the revised version.
Considering the second part of the question, it is true that our method suffers from the flat cost of the single-pass through the decoder. This cost is paid once after the last step, and is therefore a large part of the total time in few-steps regimes. This is especially true on QM9, which consists in very small molecules (9 atoms or less), making the explicit space small and cheap to operate in, mitigating the advantage of working in the latent space.
We nonetheless invite the reviewer to observe the phenomenon in larger graphs. We already discussed PubChem32 in the answer to the previous question. On PubChem16, CFM-CSD and CFM-ECLD reach a higher VUN/T than Latent FM up to 20 steps (about 249 vs. 190 at 20 steps), but with an FCD 6 to 11 times worse (1.155 and 2.083 vs. 0.190). This gap in VUN/T closes as the number of steps grows, since our generation time only goes from 3.5 to 4.3 between 2 and 20 steps, which confirms that it is dominated by the flat decoding cost. At 500 steps, Latent FM reaches the best FCD of all methods (0.171) and a VUN/T of 78.3, about 7 times higher than CFM (10.7) and DiGress (11.8).
W4
Missing important baselines and datasets. Comparisons are largely restricted to DiGress and Categorical Flow Maps. The paper doesn't include and compare important latent graph generative approaches, such as LGD, making the claimed advantages insufficiently established.
We thank the reviewer for that remark. It is true that we have focused our comparison to the state of the art explicit methods for graphs, notably one diffusion approach and one flow-based one, as these are the most widely used.
The reason for this is that the other latent graph generative methods evoked are, as far as we observed in the literature, limited to node-level latent representation, which did not provide direct comparison to our approach, while explicit graph generation is the current state of the art in generation and seemed more relevant to compare against.
We will make this clear in the revised version.
After reading your rebuttal, I still have significant concerns about the proposed method, which appears to offer little methodological novelty. Therefore, I have decided to maintain my original score.
Rebuttal: Reviewer Bt1a
We thank the reviewer for their very relevant comments. We acknowledge that our rebuttal is coming at the end of the discussion period. We want to precise that we appreciate the reviewer's work and that this delay is in no way meant to minimize that appreciation.
W1
We thank the reviewer for this comment. We agree that the components of our methods existed beforehand, and do not claim novelty regarding the architecture or training scheme of our model. What our method does is address the gap in the litterature that can be found between:
Our method proposes to address this by replacing the (gaussian) prior of the VAE by the distribution learned by a flow matching model in the latent space, where sampling from that distribution is made efficient from the fact that the space is a single vector rather than a combination of interacting ones. To the best of our knowledge, our approach is the first to address the problem of graph generation in a graph-level latent space, while other approaches remain either in the explicit graph space or in a node-level latent space. We will clarify this motivation and novelty in the revised version.
[1] Matt J. Kusner, Brooks Paige, and Jos´e Miguel Hern´andez-Lobato. Grammar variational autoencoder, 2017
[2] Wengong Jin, Regina Barzilay, and Tommi Jaakkola. Junction tree variational autoencoder for molecular graph generation, 2018
[3] Trieu Nguyen and Aleksandra Karolak. Transformer graph variational autoencoder for generative molecular design, 2025
W2
First of all, we retrained our PubChem32 model without batch-OT, and noticed that the results were improved. Our main explanation for that phenomenon is that euclidean-distance batch-OT is challenging in dimension 512 and leads to no improvement. We also replaced the original Heun solver with Euler, leading to quicker generation. We report below the new results:
PubChem32
First, this confirms the observation that out approach does not significantly benefit from large numbers of steps, since its 500-steps performance is not significantly better than that of the 20-steps method. We therefore consider our 20-steps performance as our standard in what follows.
It is true that the validity of our approach remains substantially below DiGress on PubChem32. Nonetheless, this result should be considered contextualized by the other metrics:
Our claimed scalability therefore stems from that tradeoff, where we reach better distributional fidelity on the larger dataset at a fraction of the computational cost.
We will update those results in the revised paper.