Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger
Li Sun, Ming Zhang, Wenxin Jin, Zhongtian Sun, Zhenhao Huang, Hao Peng, Sen Su, Philip S. Yu
Abstract
Hypergraphs are the natural description of higher-order interactions among objects, widely applied in social network analysis, cross-modal retrieval, etc. Hypergraph Neural Networks (HGNNs) have become the dominant solution for learning on hypergraphs. Traditional HGNNs are extended from message passing graph neural networks, following the homophily assumption, and thus struggle with the prevalent heterophilic hypergraphs that call for long-range dependence modeling. Existing solutions enlarge the message flow through the hypergraph bottleneck, mitigating the oversquashing issue and capturing long-range dependence. However, they often accelerate the loss of representation distinguishability in the repeated aggregations, leading to oversmoothing. This dilemma motivates an interesting question: Can we develop a unified mechanism that is agnostic to both homophilic and heterophilic hypergraphs? In this paper, we achieve the best of both worlds through the lens of Riemannian geometry, which provides the potential to adjust the message passing behavior in different regions. The key insight lies in the connection between oversquashing and hypergraph bottleneck within the framework of Riemannian manifold heat flow. Building on this, we propose the novel idea of locally adapting the bottlenecks of different subhypergraphs. The core innovation of the proposed mechanism is the design of an adaptive local (heat) exchanger. Specifically, it captures the rich long-range dependencies via the Robin condition, and preserves the representation distinguishability via source terms, thereby enabling heterophily-agnostic message passing with theoretical guarantees. Based on this theoretical foundation, we present a novel Heat-Exchanger with Adaptive Locality for Hypergraph Neural Network (HealHGNN), designed as a node-hyperedge bidirectional systems with linear complexity in the number of nodes and hyperedges. Extensive experiments on both homophilic and heterophilic cases show that HealHGNN achieves the state-of-the-art performance.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4c6ba099-1ffc-4691-a8d9-6264f651ca60Cited by top-tier papers1
Ask how each one uses itBuilds on23
- Hyperbolic Neural Networks++Ryohei Shimizu, Yusuke Mukuta, Tatsuya HaradaICLR 2021 · 791 citations
- You are AllSet: A Multiset Function Framework for Hypergraph Neural NetworksEli Chien, Chao Pan, Jianhao Peng, Olgica MilenkovicICLR 2022 · 209 citations
- On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and TopologyFrancesco Di Giovanni, Lorenzo Giusti, Federico Barbero, Giulia Luise et al.ICML 2023 · 190 citations
- Graph Inductive Biases in Transformers without Message PassingLiheng Ma, Chen Lin, Derek Lim, Adriana Romero-Soriano et al.ICML 2023 · 185 citations
- Clustering in graphs and hypergraphs with categorical edge labelsIlya Amburg, Nate Veldt, Austin R. BensonWWW 2020 · 118 citations
Related papers
- Multiplex Heterogeneous Graph Neural Networks with Euclidean-Riemannian Mutual Space SynergyXiang Li, Yuan Cao, Zhongying Zhao, Guoqing Chao et al.AAAI 2026
- Making Classic GNNs Strong Baselines Across Varying Homophily: A Smoothness-Generalization PerspectiveMing Gu, Zhuonan Zheng, Sheng Zhou, Meihan Liu et al.NeurIPS 2025 · 4 citations
- Auto-HeG: Automated Graph Neural Network on Heterophilic GraphsXin Zheng, Miao Zhang, Chunyang Chen, Qin Zhang et al.WWW 2023 · 46 citations
- How Particle System Theory Enhances Hypergraph Message PassingYixuan Ma, Kai Yi, Pietro Lió, Shi Jin et al.NeurIPS 2025
- Adaptive Riemannian Graph Neural NetworksXudong Wang, Chris Ding, Tongxin Li, Jicong FanAAAI 2026 · 1 citation
