mlsanityData to 14 Oct 2026

Joint Diffusion Processes as an Inductive Bias in Sheaf Neural Networks

arXiv 2407.20597 ↗First posted 30 Jul 2024cs.LG math.DScited by 9

Not on the map. Why?

Abstract (arXiv)

Sheaf Neural Networks (SNNs) naturally extend Graph Neural Networks (GNNs) by endowing a cellular sheaf over the graph, equipping nodes and edges with vector spaces and defining linear mappings between them. While the attached geometric structure has proven to be useful in analyzing heterophily and oversmoothing, so far the methods by which the sheaf is computed do not always guarantee a good performance in such settings. In this work, drawing inspiration from opinion dynamics concepts, we propose two novel sheaf learning approaches that (i) provide a more intuitive understanding of the involved structure maps, (ii) introduce a useful inductive bias for heterophily and oversmoothing, and (iii) infer the sheaf in a way that does not scale with the number of features, thus using fewer learnable parameters than existing methods. In our evaluation, we show the limitations of the real-world benchmarks used so far on SNNs, and design a new synthetic task -- leveraging the symmetries of n-dimensional ellipsoids -- that enables us to better assess the strengths and weaknesses of sheaf-based models. Our extensive experimentation on these novel datasets reveals valuable insights into the scenarios and contexts where SNNs in general -- and our proposed approaches in particular -- can be beneficial.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 16 of its 25 references that are in the map. First posted on arXiv 30 Jul 2024.

Builds on

16 of 25 references.

References · 16

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
  4. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
  5. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 261
  6. 2022Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNscited by 214
  7. 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
  8. 2022Revisiting Heterophily For Graph Neural Networkscited by 169
  9. 2018DeepInf: Social Influence Prediction with Deep Learningcited by 128
  10. 2020Sheaf Neural Networkscited by 84
  11. 2023A Hitchhiker's Guide to Geometric GNNs for 3D Atomic Systemscited by 68
  12. 2022Sheaf Neural Networks with Connection Laplacianscited by 65
4 more
  1. 2022Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyondcited by 60
  2. 2019Unveiling the potential of Graph Neural Networks for network modeling and optimization in SDNcited by 27
  3. 2023A Survey on Decentralized Federated Learningcited by 27
  4. 2024Nonlinear Sheaf Diffusion in Graph Neural Networkscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 3; 2026: 5.

9 papers.