GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Positional Encoding meets Persistent Homology on Graphs
Studying and Improving Graph Neural Network-based Motif Estimation
Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective
Learning to Represent the Evolution of Dynamic Graphs with Recurrent Models
Subgraph Gaussian Embedding Contrast for Self-Supervised Graph Representation Learning
Task-Agnostic Contrastive Pretraining for Relational Deep Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.