DeepGCNs: Making GCNs Go as Deep as CNNs

G. Li, Matthias Müller, Guocheng Qian, Itzel C. Delgadillo, Abdulellah Abualshour, Ali K. Thabet, Bernard Ghanem

Main figure for DeepGCNs: Making GCNs Go as Deep as CNNs

Abstract

Convolutional Neural Networks (CNNs) have been very successful at solving a variety of computer vision tasks such as object classification and detection, semantic segmentation, activity understanding, to name just a few. One key enabling factor for their great performance has been the ability to train very deep networks. Despite their huge success in many tasks, CNNs do not work well with non-Euclidean data, which is prevalent in many real-world applications. Graph Convolutional Networks (GCNs) offer an alternative that allows for non-Eucledian data input to a neural network. While GCNs already achieve encouraging results, they are currently limited to architectures with a relatively small number of layers, primarily due to vanishing gradients during training. This work transfers concepts such as residual/dense connections and dilated convolutions from CNNs to GCNs in order to successfully train very deep GCNs. We show the benefit of using deep GCNs (with as many as $112$ layers) experimentally across various datasets and tasks. We believe that the insights in this work will open avenues for future research on GCNs and their application to further tasks not explored in this paper. The source code for this work is available at https://github.com/lightaime/deep_gcns_torch and https://github.com/lightaime/deep_gcns for PyTorch and TensorFlow implementation respectively.

Benchmark Results

Tested on 1 dataset 1 baseline value reported too low

Tables show presented results in global context (best 3 papers + GCN + MLP).

Classic

#ModelF1 ↑Paper
1
GAMLP(JK)
0.9982 ±0.0001
2
GraphCON-GCN
0.9960
3
GCNII
0.9953 ±0.0001
7
DenseMRGCN-14
0.9943
This paper
8
ResMRGCN-28
0.9941
This paper
9
Cluster-GCN
actual #9 vs paper #10 1 place worse
0.9940
best reported
actual #9 vs paper #10 1 place worse
paper 0.9936
best today: Graph-Coupled Oscillator Networks (ICML 2022)
paper 0.9936 Δ today 0.0004
17
GaAN
0.9871
This paper
22
GeniePath
0.9850
This paper
21
GCN
0.9850
42
VR-GCN
0.9780
This paper
60
GATConv
0.9730
This paper
101
GraphSAGE
actual #101 vs paper #153 52 places worse
0.7860
best reported
actual #101 vs paper #153 52 places worse
paper 0.6120
paper 0.6120 Δ at pub 0.0880 Δ today 0.1740
173
MLP
0.4620
SOTA performance (not significantly different from the best) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported result worse than the best known when published (best reported in green) Best today — OK at publication; today's leaderboard best is elsewhere