- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduces Klein Flow Matching (KFM), a two-stage graph generator combining a autoencoder with conditional flow matching in hyperbolic latent space. Its main idea is to express Klein geodesic velocities as a fixed chord direction multiplied by a time-dependent scalar, alongside Klein-metric regression and Riemannian Heun sampling. The structural benchmarks additionally use training-derived conditions, constrained decoding, and candidate selection.
Critical strengths
None
Critical weaknesses
-
GGBall already combines hyperbolic latent representations with Riemannian flow matching, and KFM’s closed-form Klein geodesics also derive from prior work. Moreover, GGBall’s performance is stronger than KFM on the Community-small and Ego-small in Table 11.
-
The comparison is unfair. KFM generates 8x candidates, ranks candidates by their distance from the training profile, and favors non-isomorphic candidates, whereas the baselines retain their original protocols. Some of the selection criteria, particularly the degree-related statistics, are closely related to the reported distributional metrics. Furthermore, constrained construction guarantees validity, and even the profile-only control achieves 100% V.U.N. Hence, the reported results do not support better generative performance in a fair way.
-
Grid, Planar, and Tree use an additional 40D structural profile, with sampled node/edge counts replacing decoder predictions and the degree profile further guiding construction. However, no profile-free ablation is reported, so the contribution of KFM versus the supplied structural information is unclear.
Questions for authors
-
Does hyperbolic latent space provide a clear advantage for molecular graph generation, especially given that many of the compared baselines have already been evaluated on molecular graphs? Could the authors evaluate KFM on QM9, ZINC250k, MOSES, and GuacaMol?
-
Why is GGBall, the closest prior method, not included directly in the main results table? In Table 11, GGBall shows better performance than KFM.