Towards Trustworthy Hypergraph Neural Networks under Label Noise

• URL: http://arxiv.org/abs/2608.04377v1
• Date: Wed, 05 Aug 2026 02:36:58 GMT
• Title: Towards Trustworthy Hypergraph Neural Networks under Label Noise
• Abstract summary: Hypergraph neural networks (HGNNs) have demonstrated remarkable capabilities in processing complex higher-order relationships.<n>Their performance is highly dependent on labeled data, making them vulnerable to label noise.<n>Despite advances in learning with label noise (LLN) and graph learning with label noise (GLN), noisy-label learning on hypergraphs remains underexplored.
• Score: 7.708687597271703
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hypergraph neural networks (HGNNs) have demonstrated remarkable capabilities in processing complex higher-order relationships. However, their performance is highly dependent on labeled data, making them vulnerable to label noise. Despite advances in learning with label noise (LLN) and graph learning with label noise (GLN), noisy-label learning on hypergraphs remains underexplored. In this paper, we present a systematic study of hypergraph node classification under label noise. First, we adapt representative LLN and GLN methods to hypergraphs and evaluate them under a unified benchmark, revealing the limitations of existing robust learning strategies for hypergraphs. Building on this, we propose a new hypergraph robust framework, HyperTrust, which first estimates hyperedge trustworthiness through a pretraining-based, entropy-aware strategy, and then incorporates the HyperedgeBoost module to enhance reliable supervision by connecting unlabeled nodes to trustworthy hyperedges, as well as the HyperedgePrune module to suppress noisy propagation by removing untrustworthy node-hyperedge incidences. Finally, two modules work collaboratively to adjust the hypergraph structure and generate final predictions. Extensive experiments and theoretical analysis demonstrate the effectiveness and robustness of HyperTrust on multiple hypergraph datasets under various noisy settings. Our work provides a unified benchmark and an effective solution for hypergraph learning with label noise and lays a foundation for future research in this direction.

Related papers

• BHyGNN+: Unsupervised Representation Learning for Heterophilic Hypergraphs [50.161252392272324]
  We introduce BHyGNN+, a self-supervised learning framework for representation learning on heterophilic hypergraphs.<n>By contrasting augmented views of a hypergraph against its dual using cosine similarity, our framework captures essential structural patterns in a fully unsupervised manner.<n>Our results validate the effectiveness of leveraging hypergraph duality for self-supervised learning.
  arXiv  Detail & Related papers  (2026-02-16T16:55:37Z)
• Identifying and Correcting Label Noise for Robust GNNs via Influence Contradiction [25.627750818623884]
  Graph Neural Networks (GNNs) have shown remarkable capabilities in learning from graph-structured data.<n>The presence of label noise in real scenarios poses a significant challenge in learning robust GNNs.<n>We propose a novel approach called ICGNN that harnesses the structure information of the graph to effectively alleviate the challenges posed by noisy labels.
  arXiv  Detail & Related papers  (2026-01-24T14:07:07Z)
• HyperSMOTE: A Hypergraph-based Oversampling Approach for Imbalanced Node Classifications [2.172034690069702]
  We propose HyperSMOTE as a solution to alleviate the class imbalance issue in hypergraph learning. We synthesize new nodes based on samples from minority classes and their neighbors. In order to solve the problem on integrating the new node into the hypergraph, we train a decoder based on the original hypergraph incidence matrix.
  arXiv  Detail & Related papers  (2024-09-09T08:01:28Z)
• 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-MLP: Learning on Hypergraphs without Message Passing [41.43504601820411]
  Many hypergraph neural networks leverage message passing over hypergraph structures to enhance node representation learning.<n>We propose an alternative approach where we integrate the information about hypergraph structures into training supervision without explicit message passing.<n>Specifically, we introduce Hypergraph-MLP, a novel learning framework for hypergraph-structured data.
  arXiv  Detail & Related papers  (2023-12-15T13:30:04Z)
• ERASE: Error-Resilient Representation Learning on Graphs for Label Noise Tolerance [53.73316938815873]
  We propose a method called ERASE (Error-Resilient representation learning on graphs for lAbel noiSe tolerancE) to learn representations with error tolerance. ERASE combines prototype pseudo-labels with propagated denoised labels and updates representations with error resilience. Our method can outperform multiple baselines with clear margins in broad noise levels and enjoy great scalability.
  arXiv  Detail & Related papers  (2023-12-13T17:59:07Z)
• Combating Bilateral Edge Noise for Robust Link Prediction [56.43882298843564]
  We propose an information-theory-guided principle, Robust Graph Information Bottleneck (RGIB), to extract reliable supervision signals and avoid representation collapse. Two instantiations, RGIB-SSL and RGIB-REP, are explored to leverage the merits of different methodologies. Experiments on six datasets and three GNNs with diverse noisy scenarios verify the effectiveness of our RGIB instantiations.
  arXiv  Detail & Related papers  (2023-11-02T12:47:49Z)
• Enhancing Hyperedge Prediction with Context-Aware Self-Supervised Learning [57.35554450622037]
  We propose a novel hyperedge prediction framework (CASH)<n>CASH employs context-aware node aggregation to capture complex relations among nodes in each hyperedge for (C1) and (2) self-supervised contrastive learning in the context of hyperedge prediction to enhance hypergraph representations for (C2)<n>Experiments on six real-world hypergraphs reveal that CASH consistently outperforms all competing methods in terms of the accuracy in hyperedge prediction.
  arXiv  Detail & Related papers  (2023-09-11T20:06:00Z)
• 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)
• Adaptive Neural Message Passing for Inductive Learning on Hypergraphs [21.606287447052757]
  We present HyperMSG, a novel hypergraph learning framework. It adapts to the data and task by learning an attention weight associated with each node's degree centrality. It is robust and outperforms state-of-the-art hypergraph learning methods on a wide range of tasks and datasets.
  arXiv  Detail & Related papers  (2021-09-22T12:24:02Z)

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.