TL;DR
This paper introduces techniques to train very deep Graph Convolutional Networks (up to 112 layers) by adapting residual and dilated convolutions from CNNs, significantly improving performance on various graph-based tasks.
Contribution
It presents novel methods for training deep GCNs using residual/dense connections and dilated convolutions, enabling deeper architectures than previously possible.
Findings
Deep GCNs with up to 112 layers outperform shallow models.
Deep GCNs achieve state-of-the-art results in point cloud segmentation.
Deep GCNs improve node classification accuracy on PPI graphs.
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…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Convolutional Networks
