A Signed Graph Approach to Understanding and Mitigating Oversmoothing in GNNs
Jiaqi Wang, Xinyi Wu, James Cheng, Yifei Wang

TL;DR
This paper introduces a unified theoretical framework using signed graphs to understand and mitigate oversmoothing in deep GNNs, proposing a new method called Structural Balanced Propagation that improves performance across various benchmarks.
Contribution
It provides a theoretical perspective linking oversmoothing mitigation to signed graph theory and introduces SBP, a practical method leveraging structural balance for deep GNNs.
Findings
SBP improves accuracy across nine benchmarks.
SBP effectively mitigates oversmoothing at depths up to 300 layers.
Theoretical insights connect oversmoothing remedies to signed graph principles.
Abstract
Deep graph neural networks (GNNs) often suffer from oversmoothing, where node representations become overly homogeneous with increasing depth. While techniques like normalization, residual connections, and edge dropout have been proposed to mitigate oversmoothing, they are typically developed independently, with limited theoretical understanding of their underlying mechanisms. In this work, we present a unified theoretical perspective based on the framework of signed graphs, showing that many existing strategies implicitly introduce negative edges that alter message-passing to resist oversmoothing. However, we show that merely adding negative edges in an unstructured manner is insufficient-the asymptotic behavior of signed propagation depends critically on the strength and organization of positive and negative edges. To address this limitation, we leverage the theory of structural…
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
