LGMLMay 27, 2019

Graph Neural Networks Exponentially Lose Expressive Power for Node Classification

arXiv:1905.10947v5224 citationsHas Code
Originality Incremental advance
AI Analysis

This addresses a critical bottleneck in graph-based deep learning for node classification, offering a theoretical explanation and practical solution, though it is incremental as it builds on known issues in GNNs.

The paper investigates why Graph Neural Networks (GNNs) lose predictive power with many layers, showing that Graph Convolutional Networks (GCNs) exponentially approach signals containing only connected components and node degrees under certain weight conditions, and provides a weight normalization guideline that improves performance in real data.

Graph Neural Networks (graph NNs) are a promising deep learning approach for analyzing graph-structured data. However, it is known that they do not improve (or sometimes worsen) their predictive performance as we pile up many layers and add non-lineality. To tackle this problem, we investigate the expressive power of graph NNs via their asymptotic behaviors as the layer size tends to infinity. Our strategy is to generalize the forward propagation of a Graph Convolutional Network (GCN), which is a popular graph NN variant, as a specific dynamical system. In the case of a GCN, we show that when its weights satisfy the conditions determined by the spectra of the (augmented) normalized Laplacian, its output exponentially approaches the set of signals that carry information of the connected components and node degrees only for distinguishing nodes. Our theory enables us to relate the expressive power of GCNs with the topological information of the underlying graphs inherent in the graph spectra. To demonstrate this, we characterize the asymptotic behavior of GCNs on the Erdős -- Rényi graph. We show that when the Erdős -- Rényi graph is sufficiently dense and large, a broad range of GCNs on it suffers from the "information loss" in the limit of infinite layers with high probability. Based on the theory, we provide a principled guideline for weight normalization of graph NNs. We experimentally confirm that the proposed weight scaling enhances the predictive performance of GCNs in real data. Code is available at https://github.com/delta2323/gnn-asymptotics.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes