Demystifying Oversmoothing in Sheaf Neural Networks: An Index-Theoretic Criterion
Not on the map. Why?
Abstract (arXiv)
To combat oversmoothing in Graph Convolutional Networks, Sheaf Neural Networks (SNNs) were proposed as a generalization by equipping the graph with a sheaf structure and replacing the graph Laplacian with a sheaf Laplacian L. Existing analyses connect sheaf diffusion to oversmoothing via the harmonic space (kerL), taking its absolute dimension as an indicator of anti-oversmoothing capacity. However, absolute dimension alone is not a reliable measure: certain sheaf configurations inflate dim ker L while their harmonic sections remain entirely constant, without enriching discriminative capacity. We instead introduce the first relative, geometric approach, yielding a precise characterisation of anti-oversmoothing capacity. Under natural conditions on stalk transportation and global sheaf structure, we establish an index-theoretic comparison criterion showing that one sheaf's harmonic space genuinely contains another's beyond trivial inflation. We illustrate this with a concrete instance and further introduce textitGyroSheaf, a sheaf with curved gyrovector-space stalks, extending the criterion to the non-linear setting via local tangent-space linearization. Experiments across ten models confirm the theoretical criterion: sheaf models violating the criterion collapse despite possessing index jumps, while compliant models maintain depth-stable representations.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 29 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
22 of 29 references.
References · 22
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2021GRAND: Graph Neural Diffusioncited by 258
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 247
- 2019Hyperbolic Graph Neural Networkscited by 244
- 2022Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNscited by 214
- 2021Dirichlet Energy Constrained Learning for Deep Graph Neural Networkscited by 97
10 more
- 2020Sheaf Neural Networkscited by 84
- 2022Sheaf Neural Networks with Connection Laplacianscited by 65
- 2023Sheaf Hypergraph Networkscited by 34
- 2023Generalized Simplicial Attention Neural Networkscited by 27
- 2021Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matricescited by 22
- 2023Modeling Graphs Beyond Hyperbolic: Graph Neural Networks in Symmetric Positive Definite Matricescited by 10
- 2025Are We Measuring Oversmoothing in Graph Neural Networks Correctly?cited by 6
- 2026On the Necessity of Learnable Sheaf Laplacianscited by 5
- 2023DeepHGCN: Toward Deeper Hyperbolic Graph Convolutional Networkscited by 4
- 2026Sheaf Neural Networks on SPD Manifolds: Second-Order Geometric Representation Learningcited by 3
Built on by
Not cited yet.