- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
- The paper introduces HSA-Mol3D, a co-generation model for molecular graphs and 3D coordinates. HSA-Mol3D generates atom types, formal charges, bonds, and coordinates using a flow-based backbone augmented with a dynamic typed hypergraph branch for rings, aromatic systems, and conjugated structures.
- HSA-Mol3D learns and refines hyperedges from intermediate molecular states and uses staged fusion to incorporate higher-order structural information into the generative backbone. Experiments on QM9 and ablation studies on GEOM-Drugs evaluate molecular validity, geometry, ring and scaffold distributions, and molecular properties, with component ablations assessing refinement, bond-aware construction, and fusion.
Critical strengths
None
Critical weaknesses
- Regarding methodological novelty: previous graph or molecular generative models have shown that computing cycle, spectral, molecular, or RRWP features from noisy molecules and providing them as additional inputs to the denoiser improves generative fidelity [1, 2]. Thus, adding information that a neural network may not adequately capture is already a well-known strategy for molecular generation. In HSA-Mol3D, learned higher-order structural information represented by dynamic typed hypergraphs is added during generation. However, the paper does not sufficiently establish what methodological contribution the proposed hypergraph mechanism offers beyond existing structural feature augmentation strategies. I agree with the authors that the reported ablations show performance gains, but these gains alone do not establish methodological novelty beyond existing structural feature augmentation strategies.
- Limited baseline comparison: QM9 contains molecules with at most nine heavy atoms, making evaluations on larger molecules important for assessing the proposed method’s gains. Although the paper reports results on GEOM-Drugs, broader comparisons with recent models (e.g., SemlaFlow) on this more challenging dataset would provide a more informative assessment of its performance gains.
[1] DiGress: Discrete Denoising Diffusion for Graph Generation (ICLR, 2023)
[2] DeFoG: Discrete Flow Matching for Graph Generation (ICML, 2025)
Questions for authors
- Regarding conventional feature augmentation: What additional benefits does the proposed hypergraph representation offer over conventional graph feature augmentation, such as RRWP [2], cycle/ring statistics [1], and spectral features? Could the authors provide a controlled comparison with these alternatives using the same generative backbone and matched training and sampling settings?