pith. sign in

arxiv: 2006.07107 · v3 · pith:ZEMDGIRGnew · submitted 2020-06-12 · 💻 cs.LG · stat.ML

Understanding and Resolving Performance Degradation in Graph Convolutional Networks

classification 💻 cs.LG stat.ML
keywords performancegcnsnodenormdeepdegradationnodepropstrans
0
0 comments X
read the original abstract

A Graph Convolutional Network (GCN) stacks several layers and in each layer performs a PROPagation operation (PROP) and a TRANsformation operation (TRAN) for learning node representations over graph-structured data. Though powerful, GCNs tend to suffer performance drop when the model gets deep. Previous works focus on PROPs to study and mitigate this issue, but the role of TRANs is barely investigated. In this work, we study performance degradation of GCNs by experimentally examining how stacking only TRANs or PROPs works. We find that TRANs contribute significantly, or even more than PROPs, to declining performance, and moreover that they tend to amplify node-wise feature variance in GCNs, causing variance inflammation that we identify as a key factor for causing performance drop. Motivated by such observations, we propose a variance-controlling technique termed Node Normalization (NodeNorm), which scales each node's features using its own standard deviation. Experimental results validate the effectiveness of NodeNorm on addressing performance degradation of GCNs. Specifically, it enables deep GCNs to outperform shallow ones in cases where deep models are needed, and to achieve comparable results with shallow ones on 6 benchmark datasets. NodeNorm is a generic plug-in and can well generalize to other GNN architectures. Code is publicly available at https://github.com/miafei/NodeNorm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Spectral Theory of Normalized Corrected GNN Propagation

    cs.LG 2026-06 unverdicted novelty 6.0

    Proves high-probability exact recovery in binary CSBM after O(log n) steps of corrected normalized propagation in dense polylog regime under graph-signal and feature-SNR conditions.