- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper builds a consistency model for graph generation based upon GraphBSI [4] in three steps:
- Reparameterize the sampler step from the ODE from Theorem 4 in the GraphBSI paper with
- Add two consistency losses on top of the training loss: BTD based on Lagrangian self-distillation [1] and BCD as consistency target encouraging that multiple Heun result in a similar target as a single step, similar to [2]
- Sample with one or two steps
Empirically, the paper shows a slight improvement in molecule + synthetic graph generation tasks, even though baselines for single-evaluation generation are weak.
References:
[1]: Boffi, Nicholas, Michael Albergo, and Eric Vanden-Eijnden. "How to build a consistency model: Learning flow maps via self-distillation." Advances in Neural Information Processing Systems 38 (2026): 33346-33382. [2]: Frans, Kevin, et al. "One step diffusion via shortcut models." International Conference on Learning Representations. Vol. 2025. 2025.
[4]: Petersen, Ole, et al. "Discrete Bayesian Sample Inference for Graph Generation." International Conference on Learning Representations. Vol. 2026. 2026.
Critical strengths
- Good presentation
- First to train a consistency model based on GraphBSI
Critical weaknesses
- The work does not add a lot of novel ideas. GraphBSI already presents on ODE-based sampler. The reparameterization is done similary e.g. in [3], both consistency model losses are at least closely inspired by [1] and [2], respectively
- The empirical results only improve slightly against weak baselines
[3] Lu, Cheng, et al. "DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps." Advances in Neural Information Processing Systems, vol. 35, 2022.
Questions for authors
- Synthetic graph benchmarks are very noisy. Would you mind publishing results with variance over multiple random seeds?
- Results reported for e.g. GraphBSI are substantially worse than in the GraphBSI [4] paper. E.g. GraphBSI with 50 steps (EM) has validity of 99.3 for Moses in table 1 while you report validity of 45.2. Why?
- Would you mind publishing empirical results on GuacaMol?
I have read the author’s response and have revised my score.