Non-Recursive Graph Convolutional Networks

Abstract

Graph Convolutional Networks (GCNs) are powerful models for node representation learning tasks. However, the node representation in existing GCN models is usually generated by performing recursive neighborhood aggregation across multiple graph convolutional layers with certain sampling methods, which may lead to redundant feature mixing, needless information loss, and extensive computations. Therefore, in this paper, we propose a novel architecture named Non-Recursive Graph Convolutional Network (NRGCN) to improve both the training efficiency and the learning performance of GCNs in the context of node classification. Specifically, NRGCN proposes to represent different hops of neighbors for each node based on inner-layer aggregation and layer-independent sampling. In this way, each node can be directly represented by concatenating the information extracted independently from each hop of its neighbors thereby avoiding the recursive neighborhood expansion across layers. Moreover, the layer-independent sampling and aggregation can be precomputed before the model training, thus the training process can be accelerated considerably. Extensive experiments on benchmark datasets verify that our NRGCN outperforms the state-of-the-art GCN models, in terms of the node classification performance and reliability.

arXiv comment5 pages, 2 figures. Accepted to ICASSP 2021

References in corpus (13)

• Inductive Representation Learning on Large Graphs
• Spectral Networks and Locally Connected Networks on Graphs
• Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks
• Simplifying Graph Convolutional Networks
• Adversarial Attacks on Neural Networks for Graph Data
• Representation Learning on Graphs with Jumping Knowledge Networks
• DropEdge: Towards Deep Graph Convolutional Networks on Node Classification
• Adversarial Attacks on Graph Neural Networks via Meta Learning
• GraphSAINT: Graph Sampling Based Inductive Learning Method
• GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs
• Adaptive Sampling Towards Fast Graph Representation Learning
• Adversarial Attack on Graph Structured Data
• Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure