Newshot

Hierarchical Pooling for Sheaf Neural Networks

Summary

arXiv:2606.20932v2 Announce Type: replace Abstract: Sheaf neural networks (SNNs) extend graph neural networks by operating on cellular sheaves, which assign to each node and edge its own vector space, along with linear restriction maps from node spaces to the spaces associated with their incident edges. These maps determine the sheaf Laplacian and can be learned at each layer, enabling layer-specific diffusion dynamics. Existing SNN architectures, however, always diffuse on the same graph, with restriction maps that may change across layers but continue to act on the original nodes and edges. We introduce Hierarchical Sheaf Pooling (HiSP), a pooling layer that enables hierarchical representation learning in SNNs. Following the Select-Reduce-Connect-Lift framework, HiSP groups fine-scale nodes, reduces their features using the fine-scale sheaf structure, and constructs the corresponding coarse graph. A new sheaf is then learned at the coarse resolution. By interleaving sheaf diffusion a…

Original text(via arXiv cs.LG)

Computer Science > Machine Learning

Title:Hierarchical Pooling for Sheaf Neural Networks

Abstract:Sheaf neural networks (SNNs) extend graph neural networks by operating on cellular sheaves, which assign to each node and edge its own vector space, along with linear restriction maps from node spaces to the spaces associated with their incident edges. These maps determine the sheaf Laplacian and can be learned at each layer, enabling layer-specific diffusion dynamics. Existing SNN architectures, however, always diffuse on the same graph, with restriction maps that may change across layers but continue to act on the original nodes and edges. We introduce Hierarchical Sheaf Pooling (HiSP), a pooling layer that enables hierarchical representation learning in SNNs. Following the Select-Reduce-Connect-Lift framework, HiSP groups fine-scale nodes, reduces their features using the fine-scale sheaf structure, and constructs the corresponding coarse graph. A new sheaf is then learned at the coarse resolution. By interleaving sheaf diffusion and pooling, HiSP enables hierarchical SNNs to learn distinct diffusion dynamics across layers and graph resolutions. This construction supports multiscale problems in which aggregation changes both the interacting entities and their relations.
Subjects:Machine Learning (cs.LG)
Cite as:arXiv:2606.20932 [cs.LG]
(or arXiv:2606.20932v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.20932 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Additional Features

  • Audio Summary

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.LG
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗