When Design Rules Break: Benchmark Composition Determines Whether Label Informativeness Predicts GNN Aggregator Choice

27d ago · Global · primary source: export.arxiv.org

A new study finds that widely used design rules for graph neural networks fail to generalize when tested across different benchmark families, with the composition of datasets — not numerical insufficiency — determining whether performance patterns hold [1][2]. The research examines aggregator selection — choosing between sum, mean, and max operations — across 24 node-classification datasets spanning citation networks, heterophilic graphs, co-purchase, co-authorship, and the Facebook-100 collection of dense friendship networks [1][2]. Edge homophily, a common measure of how often connected nodes share labels, proved only weakly predictive of the performance gap between GIN-Sum and GIN-Mean models [2]. Label informativeness, which measures how much a node's features reveal about its label, predicted the aggregator performance gap well on legacy benchmarks. However, that relationship degraded substantially when Facebook-100 graphs were included in the analysis [2]. In the Facebook-100 graphs, near-zero label informativeness coexisted with a strong preference for sum aggregation, yielding performance gains of 7-10% and up to 13% under extended training [2]. The effect was localized to 1-hop neighborhoods and replicated across different GNN architectures [2]. Stochastic block model ablations, including degree-corrected variants that matched Facebook-100 degree scales, failed to reproduce this behavior, indicating that mean degree alone does not explain the phenomenon [2]. Among several label-independent graph statistics examined, the spectral gap uniquely distinguished the Facebook-100 graphs from other low-informativeness datasets [2]. The researchers also identified training regimes that interact with aggregator choice and demonstrated that PNA, a principal neighborhood aggregation architecture, can underperform the best single-aggregator GIN on standard citation benchmarks [2]. The findings suggest that benchmark composition determines whether design rules appear to generalize, and the Facebook-100 regime provides a concrete target for future adaptive aggregation methods [2].

research-paperbenchmark

Background sources we checked (6)
  • arxiv.org ↗ We examine whether graph neural network (GNN) design rules generalize across benchmark families by studying aggregator selection (sum, mean, max) on 24 node-classification datasets spanning citation, heterophilic, LINKX Facebook-100, co-purchase, and co-authorship graphs. Edge ho…
  • arxiv.org ↗ CatalyzeX Code Finder for Papers (What is CatalyzeX?) [...] DagsHub Toggle [...] DagsHub (What is DagsHub?)…
  • arxiv.org ↗ CatalyzeX Code Finder for Papers (What is CatalyzeX?) [...] DagsHub Toggle [...] DagsHub (What is DagsHub?)…
  • arxiv.org ↗ CatalyzeX Code Finder for Papers (What is CatalyzeX?) [...] DagsHub Toggle [...] DagsHub (What is DagsHub?)…
  • en.wikipedia.org ↗ Sustainable Development Goals (abbr. SDGs) were adopted in 2015 by all United Nations (UN) members for the 2030 Agenda for Sustainable Development. The aim of the 17 global goals is "peace and prosperity for people and the planet", tackling climate change, and working to preserv…
  • en.wikipedia.org ↗ In molecular biology, a transcription factor (TF) (or sequence-specific DNA-binding factor) is a protein that controls the rate of transcription of genetic information from DNA to messenger RNA, by binding to DNA sequences. Specificity can be due to sequence motifs, or epigenetic…

Sources

Spot something wrong? Report an issue