arXiv AI

Towards Trustworthy Hypergraph Neural Networks under Label Noise

arXiv:2608. 04377v1 Announce Type: cross Abstract: Hypergraph neural networks (HGNNs) have demonstrated remarkable capabilities in processing complex higher-order relationships.

arXiv AI
Sep 7

Hyperedge Anomaly Detection with Hypergraph Neural Network

The paper introduces an unsupervised hypergraph neural network designed to detect anomalous hyperedges—higher-order associations that deviate from typical patterns. Unlike conventional graph methods that capture only pairwise relationships, this approach leverages hypergraphs to model associations among any number of entities. Experiments on real-life datasets show the model effectively identifies unusual hyperedges without requiring labeled data.

By Md. Tanvir Alam, Md. Mahmudur Rahman, Md. Fahim Arefin, Chowdhury Farhan Ahmed, Zisan Mahmud, Md. Sadman Sakib, Carson K. Leung
arXiv Machine Learning
Sep 21

Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise

Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise proposes PCC+GCN, a hybrid framework that refines labels using Particle Competition and Cooperation before training a GCN. PCC identifies suspicious nodes via particle domination dynamics and decides whether to keep, remove, or reassign their labels, optionally augmenting the graph with k‑nearest‑neighbor edges. Evaluated on ten NoisyGL datasets under various noise types, PCC+GCN achieved the highest average accuracy and rank, outperforming baseline GCN by 1.67 percentage points and proving computationally efficient, especially under instance‑dependent noise.

By Fabricio Breve
arXiv AI
Aug 28

Rethinking Message Passing as Retrieval for Text-Attributed Graph Learning

The paper reinterprets graph neural networks (GNNs) as retrieval-augmented models, where each layer uses an MLP on a node representation and a permutation‑invariant summary of retrieved graph context instead of traditional message passing. It introduces RTA, a lightweight MLP‑based framework that replaces structural message passing with label‑aware retrieval and propagation, and provides theoretical links to softmax‑attention message passing and robustness to mis‑retrieved outliers. Experiments on text‑attributed graph benchmarks demonstrate that RTA matches or surpasses strong GNN and graph LLM baselines while improving efficiency and robustness.

By Jintang Li, Yuhong Chen, Ruofan Wu, Binli Luo, Jiayi Ji, Hui Li, Rongrong Ji
arXiv Machine Learning
Aug 20

DeGLIF for Label Noise Robust Node Classification using GNNs

The paper introduces DeGLIF, a denoising method for graph data that leverages a leave‑one‑out influence function to make node‑level predictions robust to label noise. DeGLIF uses a small clean subset and a theoretically motivated relabelling function to identify and correct noisy nodes without requiring knowledge of the noise model or level. Two variants of DeGLIF are proposed, one of which is proven to increase risk for detected noisy points, and experiments demonstrate that DeGLIF outperforms baseline algorithms on several datasets.

By Pintu Kumar, Nandyala Hemachandra