Oversmoothing Alleviation in Graph Neural Networks: A Survey and Unified View
Yufei Jin, Xingquan Zhu

TL;DR
This survey provides a unified framework called ATNPA to categorize and analyze various methods for alleviating oversmoothing in graph neural networks, highlighting their principles, strengths, and weaknesses.
Contribution
The paper introduces a unified view and taxonomy for GNN oversmoothing alleviation methods, facilitating understanding and comparison of different approaches.
Findings
Proposes ATNPA framework for GNN oversmoothing methods
Classifies existing methods into six categories within three themes
Provides insights into strengths, weaknesses, and future directions
Abstract
Oversmoothing is a common challenge in learning graph neural networks (GNN), where, as layers increase, embedding features learned from GNNs quickly become similar or indistinguishable, making them incapable of differentiating network proximity. A GNN with shallow layer architectures can only learn short-term relation or localized structure information, limiting its power of learning long-term connection, evidenced by their inferior learning performance on heterophilous graphs. Tackling oversmoothing is crucial for harnessing deep-layer architectures for GNNs. To date, many methods have been proposed to alleviate oversmoothing. The vast difference behind their design principles, combined with graph complications, make it difficult to understand and even compare the difference between different approaches in tackling the oversmoothing. In this paper, we propose ATNPA, a unified view with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
MethodsGraph Neural Network
