aiqbench analysis
This research introduces Parallel Hierarchical Pooling and Unpooling operators to adapt the U-Net architecture for hypergraph data, addressing a critical gap in non-Euclidean deep learning. By leveraging global, parallel operations derived from hierarchical clustering, the method preserves structural fidelity more effectively than sequential learning approaches. The proposed framework demonstrates superior performance in hypergraph reconstruction, classification, and anomaly detection, offering a robust new tool for processing higher-order relational data.
Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets
arXiv:2606.09051v1 Announce Type: new Abstract: Convolutions have successfully transitioned from image processing to the complex realm of non-Euclidean higher-order domains, particularly in hypergraphs. Despite the success in convolution, the exploration of a popular architecture named U-Net remains largely unexplored for hypergraph data due to the lack of well-defined pooling and unpooling operations. This work pioneers the study of U-Net architectures for hypergraph data, addressing the critical challenge of designing effective pooling and unpooling operations that retain maximal structural information from the input hypergraph. Motivated by hierarchical clustering, we propose to construct the pooling and unpooling operators all at once by cutting the clustering dendrogram at different granularities, named the Parallel Hierarchical Pooling (PHPool) and Unpooling (PHUnpool) operators. Unlike existing pooling methods that risk local structural damage through a sequential learning procedure, our PHPool operators are designed in a global and parallel manner to ensure fidelity to the original hypergraph structure with efficient computation while the PHUnpool operators are tailored to perform inverse operations of the PHPools for hypergraph reconstruction. We validate our model through hypergraph reconstruction simulation, hypergraph classification, and node-level anomaly detection, where it demonstrates superior performance over existing state-of-the-art graph and hypergraph deep learning methods.
Abstract:Convolutions have successfully transitioned from image processing to the complex realm of non-Euclidean higher-order domains, particularly in hypergraphs. Despite the success in convolution, the exploration of a popular architecture named U-Net remains largely unexplored for hypergraph data due to the lack of well-defined pooling and unpooling operations. This work pioneers the study of U-Net architectures for hypergraph data, addressing the critical challenge of designing effective pooling and unpooling operations that retain maximal structural information from the input hypergraph. Motivated by hierarchical clustering, we propose to construct the pooling and unpooling operators all at once by cutting the clustering dendrogram at different granularities, named the Parallel Hierarchical Pooling (PHPool) and Unpooling (PHUnpool) operators. Unlike existing pooling methods that risk local structural damage through a sequential learning procedure, our PHPool operators are designed in a global and parallel manner to ensure fidelity to the original hypergraph structure with efficient computation while the PHUnpool operators are tailored to perform inverse operations of the PHPools for hypergraph reconstruction. We validate our model through hypergraph reconstruction simulation, hypergraph classification, and node-level anomaly detection, where it demonstrates superior performance over existing state-of-the-art graph and hypergraph deep learning methods.
Machine Learning (cs.LG)
arXiv:2606.09051 [cs.LG]
(or arXiv:2606.09051v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.09051 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Full text under the publisher's open licence · 286 words
Related coverage

WiMi’s Quantum Circuits Boost Image Recognition Efficiency
Quantum Zeitgeist · May 28, 2026

Neural networks identify quantum phases without post-selection
Quantum Zeitgeist · Oct 16, 2026

NVIDIA QEC Ising Decoding Cuts Color Code Errors Over 347x
Quantum Zeitgeist · Jul 15, 2026

Sandia Labs maps a path to faster spin qubit tuning
Quantum Zeitgeist · Sep 16, 2026