- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes STAGE, which generates attributed graphs by serializing sorted edges into binary sequences, using SIR-GN structural rankings within BFS to reduce ordering ambiguity. It combines training on edge-perturbed graphs with self-training on generated samples selected by either an embedding-space GMM or domain-specific criteria. Experiments cover six molecular datasets and one MalNet-Tiny family, with substantial novelty gains on several molecular benchmarks. The paper also demonstrates generation of larger sparse graphs and reports memory limitations of several competing implementations.
Critical strengths
-
The edge stream avoids materializing a dense adjacency matrix and supports LSTM and Mamba backbones. The sequence length and fixed-state backbone analysis provide a reasonable scalability argument under the assumptions in Appendix B.
-
STAGE-U improves VUN from 59.36% to 86.35% on QM7x and from 83.82% to 90.52% on ANI-1x against the strongest reported baselines (Table 4). These are substantial gains, and the label-free selection option makes the approach relevant beyond domains with explicit validity checks.
Critical weaknesses
-
The presentation of this paper should be polished. For example, the first sentence of the abstract: "Generating realistic and diverse graphs is a fundamental challenge because molecules, materials, circuits, and malware can all be represented as graphs". To be honest, I do not find any challenges in this statement.
-
Higher VUN does not establish the claimed combination of novelty and distributional consistency. On MOSES, STAGE-L improves VUN to 95.07%, but its Filters score falls to 87.64 and SNN to 0.41, compared with 98.9 and 0.55 for DeFoG. On QM9, STAGE-U improves VUN modestly over SparseDiff, while molecular stability falls from 94.73% to 82.28%. The authors acknowledge this tradeoff, but the evaluation does not determine whether the additional novel samples remain comparably useful.
-
In the MalNet evaluation, “Validity” means assignment to the target family by a classifier; uniqueness and novelty use quantized, mean-pooled SIR-GN signatures. However, classifier agreement does not establish functional validity, and signature novelty is not equivalent to graph-level novelty. Evaluation in the same representation family used by the method also warrants independent checks. Moreover, Table 5 uses only 100 generations, and the final VUN difference from AutoGraph is approximately four percentage points without uncertainty estimates. Independent structural statistics, quantization sensitivity, and larger repeated evaluations would strengthen this result.
-
The manuscript does not specify sufficient settings for the generator architectures, optimizer, training schedules, actual GMM component counts and quantiles, candidate budgets, or molecular split sizes after deduplication. The binary decoder also needs explicit rules for termination, inconsistent repeated attributes, and malformed edge sequences.
Questions for authors
See weaknesses.