Research
Stability-Shaped Deep Graph Learning
arXiv:2610.06344v1 Announce Type: new Abstract: In deep graph neural networks, increasing depth enlarges the receptive field but often leads to over-smoothing, where node representations tend to align
arXiv:2610.06344v1 Announce Type: new Abstract: 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.
Related
- Dual Mamba for Node-Specific Representation Learning: Tackling Over-Smoothing with Selective State Space Modeling
- Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks
- Fixed Points Without Fixed Diffusion: Implicit Neural Sheaves for Convergent Test-Time Computation
- Exploring Oversmoothing with Householder Matrices
- The Origin of Edge of Stability
Source: arXiv cs.LG | 2026-10-06