Scholay

学术搜索 · AI 审稿 · LaTeX 协作

Harnessing Trust in Directed Graphs: Redefining Robustness of Graph Learning

作者:Zhichao Hou, Xitong Zhang, Wei Wang, Charų C. Aggarwal, Xiaorui Liu · 发表于:ACM Transactions on Knowledge Discovery from Data · 年份:2026 · DOI:10.1145/3843766 · 研究领域:Advanced Graph Neural Networks、Adversarial Robustness in Machine Learning、Privacy-Preserving Technologies in Data

Existing research on robust Graph Neural Networks (GNNs) focuses predominantly on undirected graphs, overlooking the trustworthiness inherent in the link directions of directed graphs. In this work, we analyze the limitations of current approaches from both the attack and defense perspectives and redefine the robustness of GNNs in directed graphs. From the attack side, we introduce a more realistic directed graph attack setting that addresses the shortcomings of existing attacks. From the defense side, we propose a simple yet effective message-passing framework that serves as a plug-in layer to strengthen GNN robustness while avoiding a false sense of robustness. Our findings show that the trust signals encoded in directed graphs can be harnessed to substantially improve the robustness of GNNs. When combined with existing defense strategies, the framework achieves state-of-the-art robust performance alongside strong clean accuracy against both transfer and adaptive attacks. These results point to a novel and promising direction for strengthening the robustness of graph deep learning.