- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper guides graph generation by matching counts of first-order patterns. It computes these counts through matrix operations and adds the objective to GraphVAE, with experiments on six datasets.
Critical strengths
Matching rule counts seems like a reasonable way to tell a generator which structures matter. Keeping the GraphVAE backbone the same also makes the improvements on several datasets more convincing.
Critical weaknesses
-
Proposition 1 seems incorrect as written. The left-hand penalty uses the unconditional model expectation, while the right averages conditional expectations under the variational posterior. Convexity alone does not justify switching distributions. Appendix A proves Proposition 2, so it does not resolve this.
-
Both evaluation metrics exclude attributes. This leaves unclear whether the generated graphs actually match the attribute-dependent rule statistics the method is meant to capture.
-
While the related work section covers some foundational neuro-symbolic and semantic-loss approaches, it provides limited discussion of more recent neuro-symbolic approaches that incorporate symbolic knowledge or structural constraints, like ConStruct [1] and NSGGM [2]. Although these approaches differ in objectives and mechanisms, adding them to the discussion would help better position the proposed method with recent advances in knowledge guided graph generation.
[1] Madeira et al. (2024). Generative Modelling of Structurally Constrained Graphs. NeurIPS 37, 137218–137262.
[2] Geng et al. (2026). Neural Proposals, Symbolic Guarantees: Neuro-Symbolic Graph Generation with Hard Constraints. NeurIPS 2026. arXiv:2602.16954.
Questions for authors
-
Can Proposition 1 be corrected, or does it need additional assumptions?
-
How well do generated graphs match the target rule statistics when attributes are included?
-
Can the authors clarify how their approaches differ from recent constraints guided graph generation methods in terms of potential tradeoffs and capabilities?