2020/09/07 by Tianle Cai, Cai, Tianle, Shengjie Luo +10 · 24 citations
Computer Science · Engineering · Materials Science · Mathematics · #Advanced Graph Neural Networks #FOS: Computer and information sciences #FOS: Mathematics #Ferroelectric and Negative Capacitance Devices #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning in Materials Science #Optimization and Control (math.OC) #cs.LG #math.OC #stat.ML
paper · pdf · doi:10.48550/arxiv.2009.03294
ICML 2021, Code: https://github.com/lsj2408/GraphNorm
openalex publication_date 2020/09/07 · openalex created_date 2020/09/11 · arxiv created 2021/06/11 · arxiv updated 2021/06/14 · openalex updated_date 2026/07/28
Normalization is known to help the optimization of deep neural networks. Curiously, different architectures require specialized normalization methods. In this paper, we study what normalization is effective for Graph Neural Networks (GNNs). First, we adapt and evaluate the existing methods from other domains to GNNs. Faster convergence is achieved with InstanceNorm compared to BatchNorm and LayerNorm. We provide an explanation by showing that InstanceNorm serves as a preconditioner for GNNs, but such preconditioning effect is weaker with BatchNorm due to the heavy batch noise in graph datasets. Second, we show that the shift operation in InstanceNorm results in an expressiveness degradation of GNNs for highly regular graphs. We address this issue by proposing GraphNorm with a learnable shift. Empirically, GNNs with GraphNorm converge faster compared to GNNs using other normalization. GraphNorm also improves the generalization of GNNs, achieving better performance on graph classification benchmarks.