Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger

• URL: http://arxiv.org/abs/2603.00599v1
• Date: Sat, 28 Feb 2026 11:36:35 GMT
• Title: Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger
• Authors: Li Sun, Ming Zhang, Wenxin Jin, Zhongtian Sun, Zhenhao Huang, Hao Peng, Sen Su, Philip Yu,
• Abstract summary: We present a novel Heat-Exchanger with Adaptive Locality for Hypergraph Neural Network (HealHGNN)<n>HealHGNN is designed as a node-hyperedge bidirectional systems with linear complexity in the number of nodes and hyperedges.<n>Experiments on both homophilic and heterophilic cases show that HealHGNN achieves the state-of-the-art performance.
• Score: 16.833612337456373
• License: http://creativecommons.org/licenses/by/4.0/
• 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. In this paper, we achieve heterophily-agnostic message passing through the lens of Riemannian geometry. 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.

Related papers

• Hypergraph Contrastive Learning for both Homophilic and Heterophilic Hypergraphs [36.44792866509702]
  Hypergraph neural networks (HNNs) have been widely used to capture complex high-order relationships.<n>We propose textbfHONOR, a novel unsupervised textbfHypergraph ctextbfONtrastive learning framework suitable for both homtextbfOphilic and hetetextbfRophilic hypergraphs.
  arXiv  Detail & Related papers  (2025-11-24T05:35:46Z)
• Implicit Hypergraph Neural Networks: A Stable Framework for Higher-Order Relational Learning with Provable Guarantees [8.5183483099116]
  We introduce Implicit Hypergraph Neural Networks (IHGNN), which computes representations as the solution to a nonlinear fixed-point equation.<n>IHGNN consistently outperforms strong traditional graph/hypergraph neural network baselines in both accuracy and robustness.
  arXiv  Detail & Related papers  (2025-08-13T02:06:29Z)
• Multi-Granular Attention based Heterogeneous Hypergraph Neural Network [5.580244361093485]
  Heterogeneous graph neural networks (HeteGNNs) have demonstrated strong abilities to learn node representations.<n>This paper proposes MGA-HHN, a Multi-Granular Attention based Heterogeneous Hypergraph Neural Network for representation learning.
  arXiv  Detail & Related papers  (2025-05-07T11:42:00Z)
• Hypergraph Transformer for Semi-Supervised Classification [50.92027313775934]
  We propose a novel hypergraph learning framework, HyperGraph Transformer (HyperGT) HyperGT uses a Transformer-based neural network architecture to effectively consider global correlations among all nodes and hyperedges. It achieves comprehensive hypergraph representation learning by effectively incorporating global interactions while preserving local connectivity patterns.
  arXiv  Detail & Related papers  (2023-12-18T17:50:52Z)
• Hypergraph Neural Networks through the Lens of Message Passing: A Common Perspective to Homophily and Architecture Design [6.993718963663415]
  We introduce a novel conceptualization of homophily in higher-order networks based on a Message Passing scheme.<n>We investigate some natural, yet mostly unexplored, strategies for processing higher-order structures within HNNs.
  arXiv  Detail & Related papers  (2023-10-11T17:35:20Z)
• A Unified View Between Tensor Hypergraph Neural Networks And Signal Denoising [7.083679120873857]
  We show that the tensor-hypergraph convolutional network (T-HGCN) has emerged as a powerful architecture for preserving higher-order interactions on hypergraphs. We further design a tensor-hypergraph iterative network (T-HGIN) based on the HyperGSD problem, which takes advantage of a multi-step updating scheme in every single layer.
  arXiv  Detail & Related papers  (2023-09-15T13:19:31Z)
• From Hypergraph Energy Functions to Hypergraph Neural Networks [94.88564151540459]
  We present an expressive family of parameterized, hypergraph-regularized energy functions. We then demonstrate how minimizers of these energies effectively serve as node embeddings. We draw parallels between the proposed bilevel hypergraph optimization, and existing GNN architectures in common use.
  arXiv  Detail & Related papers  (2023-06-16T04:40:59Z)
• Relation Embedding based Graph Neural Networks for Handling Heterogeneous Graph [58.99478502486377]
  We propose a simple yet efficient framework to make the homogeneous GNNs have adequate ability to handle heterogeneous graphs. Specifically, we propose Relation Embedding based Graph Neural Networks (RE-GNNs), which employ only one parameter per relation to embed the importance of edge type relations and self-loop connections.
  arXiv  Detail & Related papers  (2022-09-23T05:24:18Z)
• Equivariant Hypergraph Diffusion Neural Operators [81.32770440890303]
  Hypergraph neural networks (HNNs) using neural networks to encode hypergraphs provide a promising way to model higher-order relations in data. This work proposes a new HNN architecture named ED-HNN, which provably represents any continuous equivariant hypergraph diffusion operators. We evaluate ED-HNN for node classification on nine real-world hypergraph datasets.
  arXiv  Detail & Related papers  (2022-07-14T06:17:00Z)
• Simple and Efficient Heterogeneous Graph Neural Network [55.56564522532328]
  Heterogeneous graph neural networks (HGNNs) have powerful capability to embed rich structural and semantic information of a heterogeneous graph into node representations. Existing HGNNs inherit many mechanisms from graph neural networks (GNNs) over homogeneous graphs, especially the attention mechanism and the multi-layer structure. This paper conducts an in-depth and detailed study of these mechanisms and proposes Simple and Efficient Heterogeneous Graph Neural Network (SeHGNN)
  arXiv  Detail & Related papers  (2022-07-06T10:01:46Z)
• Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs [59.71134113268709]
  We present General Hypergraph Spectral Convolution(GHSC), a general learning framework that can handle EDVW and EIVW hypergraphs. In this paper, we show that the proposed framework can achieve state-of-the-art performance. Experiments from various domains including social network analysis, visual objective classification, protein learning demonstrate that the proposed framework can achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2022-03-31T10:46:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.