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
arXiv:2607. 00671v1 Announce Type: cross Abstract: Graphs are a complex and versatile data structure used across various domains, with possibly multi-label nodes playing a particularly crucial role.
By Yifei Sun, Zemin Liu, Bryan Hooi, Yang Yang, Rizal Fathony, Jia Chen, Bingsheng He
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:2606. 05756v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have demonstrated remarkable performance across a range of applications involving graph-structured data, particularly in high-stakes domains.
By Jialiang Yin, Zheng Zhao, Linsey Pang, Bo Dong, Bin Shi, Jiaxing Zhang
arXiv:2606. 14965v1 Announce Type: new Abstract: Synthetic instance-dependent label noise (IDN) benchmarks are widely used to evaluate noisy-label learning methods, yet existing approaches typically generate noise through imperfect annotators or classifier raters, leaving the source of ambiguity implicit.
By Shadman Islam, Agustinus Kristiadi, Mostafa Milani
arXiv:2608. 04377v1 Announce Type: cross Abstract: Hypergraph neural networks (HGNNs) have demonstrated remarkable capabilities in processing complex higher-order relationships.
By Mengyao Zhou, Zhiheng Zhou, Xiao Han, Guiying Yan
arXiv:2606. 07475v1 Announce Type: cross Abstract: Node classification in graph neural networks (GNNs) has been widely applied in various fields of graph analysis.
By Takuto Takahashi, Itsuki Nakayama, Takahiro Mitani, Ryosuke Kikuchi, Yuya Sasaki, Makoto Onizuka
arXiv:2606. 08467v1 Announce Type: cross Abstract: While confidence calibration is essential for trustworthy decision-making in safety-critical applications, the robustness of calibrated GNNs to adversarial structural perturbations remains largely unexplored.
By Cuong Dang, Jiahao Zhang, Hieu Ta Quang, Dung Le, Lu Cheng, Suhang Wang
arXiv:2607. 03587v1 Announce Type: new Abstract: We propose NetinfoGC, a framework for graph classification that extends the Network Usable Information (NUI) paradigm to graph-level learning.
By Abdullah Shaik, Anwar Said
The paper introduces SEMGNN, an end‑to‑end self‑explainable multi‑label graph neural network that simultaneously classifies nodes and identifies edges contributing to each predicted label. Unlike post‑hoc explainers, SEMGNN jointly learns a predictor and a sparse edge‑mask explainer, leveraging label‑label correlations to improve classification and generate distinct, coherent explanations for each label. Experiments on synthetic and real‑world networks in social, entertainment, and life‑science domains demonstrate competitive predictive performance and more faithful, compact label‑conditioned explanations.
By Yingqi Feng, Yufei Tang, Min Shi, Xingquan Zhu
arXiv:2606. 11699v1 Announce Type: new Abstract: The performance of machine learning and deep learning models largely depends on the quality of the training data.
By Ha-Linh Nguyen, Hong-Anh Nguyen, Minh-Duc La, Thu-Trang Nguyen, Son Nguyen, Hieu Dinh Vo
arXiv:2606. 29773v1 Announce Type: new Abstract: Graphs are widely used to model relational systems, with applications in domains such as social networks, finance, and biomedicine.
By Haoxin Sun, Yiqing Lin, Yajun Huang, Chenhui Dong, Mingjun Li, Zhongzhi Zhang