- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces neural parameterizations of probabilistic graph grammars while retaining exact inference over derivations. It evaluates likelihood and generalization on semantic graphs, graph generation, and molecular property prediction.
Critical strengths
Sharing information across structurally similar rules makes sense, especially for rare productions. Keeping exact inference is useful, and the experiments show applications beyond fitting linguistic graphs.
Critical weaknesses
-
The handling of unseen rules is unclear. Appendix E says the grammar comes from training derivations, so how do the unseen rules in Table 3 enter the inventory? Appendix F also says its grammar is extracted “from the corpus” without specifying whether this uses only training data.
-
The molecular comparisons use the same grammar-admitted molecules, but the paper does not report how much of each dataset is excluded. Table 5 also lacks a uniform-rule grammar baseline to separate the benefit of learning rule probabilities from the grammar itself.
-
The related work should discuss recent neuro-symbolic graph generation works like ConStruct [1] and NSGGM [2]. Both incorporate structural constraints into graph generation.
Reference:
[1] Madeira et al. (2024). Generative Modelling of Structurally Constrained Graphs. NeurIPS 37, 137218–137262.
[2] Geng et al. Neural Proposals, Symbolic Guarantees: Neuro-Symbolic Graph Generative Modeling. NeurIPS, 2026. arXiv:2602.16954.
Questions for authors
-
How are unseen rules handled in Table 3, and is the Appendix F grammar extracted strictly from training data?
-
What fraction of each molecular dataset does the grammar admit, and how does a uniform-rule version perform in Table 5?
-
Can you compare your approach with [1] and [2]? If a direct comparison is not feasible, please explain how the methods differ in supported graph structures, generation procedure, and computational cost.