Residual Gated Graph ConvNets
Xavier Bresson, Thomas Laurent

TL;DR
This paper compares graph RNNs and ConvNets, proposing residual gated graph ConvNets that outperform RNNs in accuracy and speed for graph learning tasks, with residuality significantly enhancing performance.
Contribution
It introduces residual gated graph ConvNets, extending LSTM and ConvNet architectures to variable-sized graphs and demonstrating their superior performance over RNNs and non-learning methods.
Findings
Graph ConvNets are 3-17% more accurate than RNNs.
Graph ConvNets are 1.5-4x faster than RNNs.
Residuality provides a 10% performance gain.
Abstract
Graph-structured data such as social networks, functional brain networks, gene regulatory networks, communications networks have brought the interest in generalizing deep learning techniques to graph domains. In this paper, we are interested to design neural networks for graphs with variable length in order to solve learning problems such as vertex classification, graph classification, graph regression, and graph generative tasks. Most existing works have focused on recurrent neural networks (RNNs) to learn meaningful representations of graphs, and more recently new convolutional neural networks (ConvNets) have been introduced. In this work, we want to compare rigorously these two fundamental families of architectures to solve graph learning tasks. We review existing graph RNN and ConvNet architectures, and propose natural extension of LSTM and ConvNet to graphs with arbitrary size.…
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
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Machine Learning in Materials Science
