A Sheaf Neural Network (SNN) is a type of Graph Neural Network (GNN) that operates on a sheaf, an object that equips a graph with vector spaces over its nodes and edges and linear maps between these spaces. SNNs have been shown to have useful theoretical properties that help tackle issues arising from heterophily and over-smoothing. One complication intrinsic to these models is finding a good sheaf for the task to be solved. Previous works proposed two diametrically opposed approaches: manually constructing the sheaf based on domain knowledge and learning the sheaf end-to-end using gradient-based methods. However, domain knowledge is often insufficient, while learning a sheaf could lead to overfitting and significant computational overhead. In this work, we propose a novel way of computing sheaves drawing inspiration from Riemannian geometry: we leverage the manifold assumption to compute manifold-and-graph-aware orthogonal maps, which optimally align the tangent spaces of neighbouring data points. We show that this approach achieves promising results with less computational overhead when compared to previous SNN models. Overall, this work provides an interesting connection between algebraic topology and differential geometry, and we hope that it will spark future research in this direction.

Sheaf Neural Networks with Connection Laplacians / Barbero, F.; Bodnar, C.; de Ocariz Borde, H. S.; Bronstein, M.; Velickovic, P.; Lio, P.. - 196:(2022), pp. 28-36. (Intervento presentato al convegno ICML Workshop on Topology, Algebra, and Geometry in Machine Learning, TAG:ML 2022 tenutosi a Virtual, Online).

Sheaf Neural Networks with Connection Laplacians

Lio P.
2022

Abstract

A Sheaf Neural Network (SNN) is a type of Graph Neural Network (GNN) that operates on a sheaf, an object that equips a graph with vector spaces over its nodes and edges and linear maps between these spaces. SNNs have been shown to have useful theoretical properties that help tackle issues arising from heterophily and over-smoothing. One complication intrinsic to these models is finding a good sheaf for the task to be solved. Previous works proposed two diametrically opposed approaches: manually constructing the sheaf based on domain knowledge and learning the sheaf end-to-end using gradient-based methods. However, domain knowledge is often insufficient, while learning a sheaf could lead to overfitting and significant computational overhead. In this work, we propose a novel way of computing sheaves drawing inspiration from Riemannian geometry: we leverage the manifold assumption to compute manifold-and-graph-aware orthogonal maps, which optimally align the tangent spaces of neighbouring data points. We show that this approach achieves promising results with less computational overhead when compared to previous SNN models. Overall, this work provides an interesting connection between algebraic topology and differential geometry, and we hope that it will spark future research in this direction.
2022
ICML Workshop on Topology, Algebra, and Geometry in Machine Learning, TAG:ML 2022
Geometry; Graph neural networks; Knowledge graph; Machine learning; Topology; Vector spaces
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Sheaf Neural Networks with Connection Laplacians / Barbero, F.; Bodnar, C.; de Ocariz Borde, H. S.; Bronstein, M.; Velickovic, P.; Lio, P.. - 196:(2022), pp. 28-36. (Intervento presentato al convegno ICML Workshop on Topology, Algebra, and Geometry in Machine Learning, TAG:ML 2022 tenutosi a Virtual, Online).
File allegati a questo prodotto
File Dimensione Formato  
Barbero_Sheaf_2022.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 648.66 kB
Formato Adobe PDF
648.66 kB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1727094
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 0
social impact