Over-smoothing Effect of Graph Convolutional Networks
Over-smoothing is a severe problem which limits the depth of Graph Convolutional Networks. This article gives a comprehensive analysis of the mechanism behind Graph Convolutional Networks and the over-smoothing effect. The article proposes an upper bound for the occurrence of over-smoothing, which offers insight into the key factors behind over-smoothing. The results presented in this article successfully explain the feasibility of several algorithms that alleviate over-smoothing.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
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 …
Link PredictionNode ClassificationSSFG: Stochastically Scaling Features and Gradients for Regularizing Graph Convolutional Networks
Graph convolutional networks have been successfully applied in various graph-based tasks. In a typical graph convolutional layer, node features are updated by aggregating neighborhood information. Repeatedly applying gra…
Graph LearningSimple and Deep Graph Convolutional Networks
Graph convolutional networks (GCNs) are a powerful deep learning approach for graph-structured data. Recently, GCNs and subsequent variants have shown superior performance in various application areas on real-world datas…
Graph ClassificationGraph RegressionLink PredictionNode Classification+2Poisson Kernel Avoiding Self-Smoothing in Graph Convolutional Networks
Graph convolutional network (GCN) is now an effective tool to deal with non-Euclidean data, such as social networks in social behavior analysis, molecular structure analysis in the field of chemistry, and skeleton-based …
Action RecognitionSkeleton Based Action RecognitionRevisiting Graph Convolutional Network on Semi-Supervised Node Classification from an Optimization Perspective
Graph convolutional networks (GCNs) have achieved promising performance on various graph-based tasks. However they suffer from over-smoothing when stacking more layers. In this paper, we present a quantitative study on t…
General ClassificationNode Classification