Let the Heads Talk: Beyond Diagonal Graph Attention
Not on the map. Why?
Abstract (arXiv)
Sheaf Neural Networks generalize scalar-weighted message passing by replacing scalar edge weights with linear transport maps between local feature spaces. Yet the role of this matrix-valued transport is entangled with the broader sheaf-diffusion construction. We isolate the transport primitive through quiver representations and establish a direct connection with multi-head attention. Treating attention heads as coordinates of a local transport space reveals that standard multi-head attention implements diagonal edge maps: along each directed interaction, a source head can contribute only to the corresponding receiver head. Allowing off-diagonal entries instead enables edge-conditioned communication across heads before neighborhood aggregation. We show that this operation cannot, in general, be absorbed into a single shared linear map applied after aggregation. Building on this characterization, we introduce Topological Attention (Top-A), a multi-head attention that learns edge-dependent off-diagonal routes while preserving the original same-head paths and exactly recovering vanilla attention when the additional routing vanishes. We evaluate Top-A on relational reasoning, heterogeneous graph learning, and algorithmic reasoning, including out-of-distribution generalization, with heterophilic node classification as a contrast setting. The results show that cross-head transport is most useful when the task benefits from interaction-dependent transformations, while heterophily alone provides no systematic advantage. These findings identify edge-conditioned cross-head communication as a distinct computational primitive of matrix-valued transport.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 32 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
24 of 32 references.
References · 24
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
12 more
- 2022Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNscited by 208
- 2022The CLRS Algorithmic Reasoning Benchmarkcited by 103
- 2020Sheaf Neural Networkscited by 80
- 2020Talking-Heads Attentioncited by 57
- 2022Relational Attention: Generalizing Transformers for Graph-Structured Taskscited by 41
- 2024The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challengescited by 29
- 2025Copresheaf Topological Neural Networks: A Generalized Deep Learning Frameworkcited by 11
- 2025Cooperative Sheaf Neural Networkscited by 10
- 2024Improving Transformers with Dynamically Composable Multi-Head Attentioncited by 8
- 2026On the Necessity of Learnable Sheaf Laplacianscited by 5
- 2024Systematic Relational Reasoning With Epistemic Graph Neural Networkscited by 4
- 2026Benchmarking Sheaf Neural Networks for Inductive Taskscited by 1
Built on by
Not cited yet.