SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks
원문 초록
Graph Convolutional Networks (GCNs) suffer from performance degradation when models go deeper. However, earlier works only attributed the performance degeneration to over-smoothing. In this paper, we conduct theoretical and experimental analysis to explore the fundamental causes of performance degradation in deep GCNs: over-smoothing and gradient vanishing have a mutually reinforcing effect that causes the performance to deteriorate more quickly in deep GCNs. On the other hand, existing anti-over-smoothing methods all perform full convolutions up to the model depth. They could not well resist the exponential convergence of over-smoothing due to model depth increasing. In this work, we propose a simple yet effective plug-and-play module, Skipnode, to overcome the performance degradation of deep GCNs. It samples graph nodes in each convolutional layer to skip the convolution operation. In this way, both over-smoothing and gradient vanishing can be effectively suppressed since (1) not all nodes'features propagate through full layers and, (2) the gradient can be directly passed back through ``skipped'' nodes. We provide both theoretical analysis and empirical evaluation to demonstrate the efficacy of Skipnode and its superiority over SOTA baselines.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
ABG-NAS: Adaptive Bayesian Genetic Neural Architecture Search for Graph Representation Learning
MSGCN: Multiplex Spatial Graph Convolution Network for Interlayer Link Weight Prediction
Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Integrating Structural and Semantic Signals in Text-Attributed Graphs with BiGTex
토론
이 논문과 연결된 포럼 글이 아직 없습니다.