Simple and Deep Graph Convolutional Networks
Graph convolutional networks (GCNs) are a powerful deep learning approach for graph-structured data. Recently, GCNs and subsequent variants have shown superior performance in various application areas on real-world datasets. Despite their success, most of the current GCN models are shallow, due to the {\em over-smoothing} problem. In this paper, we study the problem of designing and analyzing deep graph convolutional networks. We propose the GCNII, an extension of the vanilla GCN model with two simple yet effective techniques: {\em Initial residual} and {\em Identity mapping}. We provide theoretical and empirical evidence that the two techniques effectively relieves the problem of over-smoothing. Our experiments show that the deep GCNII model outperforms the state-of-the-art methods on various semi- and full-supervised tasks. Code is available at https://github.com/chennnM/GCNII .
Code (4)
Tasks
Graph ClassificationGraph RegressionLink PredictionNode ClassificationNode Classification on Non-Homophilic (Heterophilic) GraphsNode Property PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Simple Graph Convolutional Networks
Many neural networks for graphs are based on the graph convolution operator, proposed more than a decade ago. Since then, many alternative definitions have been proposed, that tend to add complexity (and non-linearity) t…
A Simple Spectral Failure Mode for Graph Convolutional Networks
Neural networks have achieved remarkable successes in machine learning tasks. This has recently been extended to graph learning using neural networks. However, there is limited theoretical work in understanding how and w…
Graph EmbeddingGraph LearningOn Filter Size in Graph Convolutional Networks
Recently, many researchers have been focusing on the definition of neural networks for graphs. The basic component for many of these approaches remains the graph convolution idea proposed almost a decade ago. In this pap…
Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks
Graph autoencoders (AE) and variational autoencoders (VAE) recently emerged as powerful node embedding methods, with promising performances on challenging tasks such as link prediction and node clustering. Graph AE, VAE …
ClusteringLink PredictionNode ClusteringSPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network
A wide range of machine learning problems involve handling graph-structured data. Existing machine learning approaches for graphs, however, often imply computing expensive graph similarity measures, preprocessing input g…
BIG-bench Machine LearningDeep LearningGeneral ClassificationGraph Classification+1