Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs
Abstract
A number of problems can be formulated as prediction on graph-structured data. In this work, we generalize the convolution operator from regular grids to arbitrary graphs while avoiding the spectral domain, which allows us to handle graphs of varying size and connectivity. To move beyond a simple diffusion, filter weights are conditioned on the specific edge labels in the neighborhood of a vertex. Together with the proper choice of graph coarsening, we explore constructing deep neural networks for graph classification. In particular, we demonstrate the generality of our formulation in point cloud classification, where we set the new state of the art, and on a graph classification dataset, where we outperform other deep learning approaches. The source code is available at.
Benchmark Results
Tested on 4 datasets 2 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9910
±0.0030 | |
| 2 | ID-GNN+BEC | 0.9830
±0.0360 | |
| 3 | SupCosine | 0.9830
±0.0250 | |
| 39 | GIN | 0.9330
±0.0290 | |
| 51 | PSCN | 0.9263 | This paper |
| 159 | WL | 0.9040
±0.0570 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) best today: How Powerful are $K$-hop Message Passing Graph Neural Networks (NeurIPS 2022) |
| 236 | ECC | 0.8944 | This paper |
| 323 | structure2vec | 0.8828 | This paper |
| 366 | deepwl | 0.8744 | This paper |
| 403 | MLP | 0.8660
±0.0495 | |
| 770 | DCNN | 0.6700 best reported | best today: IGNN-Solver: A Graph Neural Solver for Implicit Graph Neural Networks (2024) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 | |
| 3 | GCN | 0.9727 | |
| 12 | WL | 0.8590
±0.0010 best reported | best at pub: Propagation Kernels (2014) |
| 43 | ECC | 0.8380 | This paper |
| 45 | structure2vec | 0.8372 | This paper |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 211 | deepwl | 0.8031 | This paper |
| 291 | PSCN | 0.7859 | This paper |
| 540 | DCNN | 0.6261 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GMN | 0.7866 | |
| 2 | MemGNN | 0.7550 | |
| 3 | TFGW SP | 0.7510
±0.0500 | |
| 17 | GatedGCN | 0.7000
±0.0494 | |
| 18 | WL | 0.5905 | prev best: The Multiscale Laplacian Graph Kernel (NeurIPS 2016) best today: Template based Graph Neural Network with Optimal Transport Distances (NeurIPS 2022) |
| 26 | GraphSAGE | 0.6817
±0.0545 | |
| 80 | structure2vec | 0.6110 | This paper |
| 124 | MLP | 0.5583
±0.0352 | |
| 143 | ECC | 0.5350 | This paper |
| 144 | deepwl | 0.5343 | prev best: Diffusion-Convolutional Neural Networks (NeurIPS 2015) |
| 181 | DCNN | 0.4244
±0.0176 best reported | best today: Graph Capsule Convolutional Neural Networks (ICML 2018) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GC-GNN (GCN) | 0.9210
±0.0810 | |
| 2 | SUGAR | 0.8403
±0.0133 | |
| 3 | Ortho-g-U-Nets | 0.8387 | |
| 7 | structure2vec | 0.8222 | This paper |
| 15 | SAGE | 0.8088
±0.0233 | |
| 25 | WL | 0.7978 | prev best: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) |
| 101 | PSCN | 0.7712 | This paper |
