Property-Driven Evaluation of GNN Expressiveness at Scale: Datasets, Framework, and Study
Sicong Che, Jiayi Yang, Sarfraz Khurshid, Wenxi Wang

TL;DR
This paper introduces a formal, property-driven evaluation framework for GNNs, using large-scale datasets and systematic metrics to analyze their ability to capture fundamental graph properties, revealing key trade-offs among pooling methods.
Contribution
It develops a comprehensive, formal evaluation methodology and large datasets for assessing GNN expressiveness across multiple properties, providing new insights into pooling method performance.
Findings
Attention-based pooling improves generalization and robustness.
Second-order pooling enhances sensitivity to graph properties.
No single pooling method excels across all evaluated properties.
Abstract
Advancing trustworthy AI requires principled software engineering approaches to model evaluation. Graph Neural Networks (GNNs) have achieved remarkable success in processing graph-structured data, however, their expressiveness in capturing fundamental graph properties remains an open challenge. We address this by developing a property-driven evaluation methodology grounded in formal specification, systematic evaluation, and empirical study. Leveraging Alloy, a software specification language and analyzer, we introduce a configurable graph dataset generator that produces two dataset families: GraphRandom, containing diverse graphs that either satisfy or violate specific properties, and GraphPerturb, introducing controlled structural variations. Together, these benchmarks encompass 336 new datasets, each with at least 10,000 labeled graphs, covering 16 fundamental graph properties…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Adversarial Robustness in Machine Learning · Graph Theory and Algorithms
