Understanding Oversmoothing in Diffusion-Based GNNs From the Perspective of Operator Semigroup Theory
원문 초록
This paper presents a novel study of the oversmoothing issue in diffusion-based Graph Neural Networks (GNNs). Diverging from extant approaches grounded in random walk analysis or particle systems, we approach this problem through operator semigroup theory. This theoretical framework allows us to rigorously prove that oversmoothing is intrinsically linked to the ergodicity of the diffusion operator. This finding further poses a general and mild ergodicity-breaking condition, encompassing the various specific solutions previously offered, thereby presenting a more universal and theoretically grounded approach to mitigating oversmoothing in diffusion-based GNNs. Additionally, we offer a probabilistic interpretation of our theory, forging a link with prior works and broadening the theoretical horizon. Our experimental results reveal that this ergodicity-breaking term effectively mitigates oversmoothing measured by Dirichlet energy, and simultaneously enhances performance in node classification tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
Improving the Effective Receptive Field of Message-Passing Neural Networks
Scalable Graph Generative Modeling via Substructure Sequences
토론
이 논문과 연결된 포럼 글이 아직 없습니다.