Michael Bronstein, Pietro Liò, Petar Veličković, Cristian Bodnar, Federico Barbero, Haitz Sáez De Ocáriz Borde
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 gradientbased 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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2206.08702")
get_code_for_paper("2206.08702")
have("2206.08702")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2206.08702.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2206.08702)
Connect an agent — have() is free.