Stability-Shaped Deep Graph Learning
Not on the map. Why?
Abstract (arXiv)
In deep graph neural networks, increasing depth enlarges the receptive field but often leads to over-smoothing, where node representations tend to align. We develop a unified, mode-wise stability framework for deep GNN propagation that provides a principled characterization of over-smoothing. By interpreting layer depth as time and layer updates as graph-coupled dynamics, over-smoothing can be understood as an undesirable dynamical synchronization of features, for which the master stability curve provides a theoretical tool to assess the stability of synchrony. Guided by this theory, we further propose Stability-Shaped Deep Graph Learning (SDGL) to mitigate over-smoothing in deep GNNs. SDGL has two complementary instantiations: one induces controlled Turing instability to replace synchronization with spatial pattern formation, and the other maintains stable near-critical propagation. Experiments on diverse node- and graph-level benchmarks demonstrate the improved depth scaling and consistent accuracy gains over strong baselines, including graphs exhibiting long-range dependencies.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 63 references that are in the map. First posted on arXiv 5 Oct 2026.
Builds on
2 of 63 references.
References · 2
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 249
- 2025Resolving Oversmoothing with Opinion Dissensuscited by 2
Built on by
Not cited yet.