How Powerful are Graph Neural Networks?

Code

• github.com/weihua916/powerful-gnns
  OfficialIn paperpytorch★ 0
• github.com/lukecavabarrett/pna
  pytorch★ 356
• github.com/yuwvandy/g2gnn
  pytorch★ 45
• github.com/egyptdj/graph-neural-mapping
  pytorch★ 28
• github.com/karolismart/dropgnn
  pytorch★ 26
• github.com/guillaumejaume/tuto-dl-on-graphs
  pytorch★ 14
• github.com/gmum/umwpl2021
  none★ 10
• github.com/igorsterner/commute-opt-gnn
  pytorch★ 3
• github.com/k4my4r/ECG-Classification
  pytorch★ 0
• github.com/pfnet-research/treewidth-prediction
  none★ 0

Abstract

Graph Neural Networks (GNNs) are an effective framework for representation learning of graphs. GNNs follow a neighborhood aggregation scheme, where the representation vector of a node is computed by recursively aggregating and transforming representation vectors of its neighboring nodes. Many GNN variants have been proposed and have achieved state-of-the-art results on both node and graph classification tasks. However, despite GNNs revolutionizing graph representation learning, there is limited understanding of their representational properties and limitations. Here, we present a theoretical framework for analyzing the expressive power of GNNs to capture different graph structures. Our results characterize the discriminative power of popular GNN variants, such as Graph Convolutional Networks and GraphSAGE, and show that they cannot learn to distinguish certain simple graph structures. We then develop a simple architecture that is provably the most expressive among the class of GNNs and is as powerful as the Weisfeiler-Lehman graph isomorphism test. We empirically validate our theoretical findings on a number of graph classification benchmarks, and demonstrate that our model achieves state-of-the-art performance.

Tasks

Benchmark Results

Reproductions