Skip to content
OtherLow

Stability-Shaped Deep Graph Learning

Occurred
Oct 5, 2026
Published
Oct 5, 2026
Source
arXiv

Summary

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.

Classification

Category confidence: 95%
Severity confidence: 95%

Rationale: This is a theoretical research paper on deep graph neural networks, not a safety incident.

Classifier: Qwen/Qwen3.5-35B-A3B-FP8

Visit source