This work introduces XIGL, an architecture-agnostic human-in-the-loop strategy for removing shortcuts from GNNs, and develops an active learning strategy for prioritizing explanations that are more likely to display shortcut behavior, lowering annotation and cognitive costs.
Abstract
Graph Neural Networks (GNNs) can solve prediction tasks by unintentionally exploiting shortcuts---that is, edges, nodes, and features that correlate with but are not causal for the prediction---which compromise their reliability in out-of-distribution tasks. We introduce XIGL, an architecture-agnostic human-in-the-loop strategy for removing such shortcuts from GNNs. Our key insight is twofold. On the one hand, reliance on shortcuts can be detected by inspecting GNN explanations. On the other hand, once made aware of such shortcuts, sufficiently expert users can provide tailored corrective feedback, which helps deconfound the model. XIGL supports any query strategy; however, since corrective feedback can be expensive to acquire, we develop an active learning strategy for prioritizing explanations that are more likely to display shortcut behavior, lowering annotation and cognitive costs. We showcase the effectiveness of XIGL, including both existing and proposed explanation-based strategies, on several GNN architectures. Our implementation is available online.
GRAPHSU is proposed, a graph-guided controller that expands the deletion scope beyond forget seeds by constructing a weighted support-route graph, propagating deletion pressure through it, and applying graded forgetting strengths to high-risk neighbors, demonstrating that effective enterprise unlearning requires contro...
Waqas Khan, Tabinda Sarwar, Jingyue Cong et al.· 0 citations
A multimodal model that combines two complementary ideas: a self-supervised method that enables a GNN encoder pretrained on one dataset to operate directly on another dataset with a different node-feature dimensionality, without rebuilding the model or realigning the data is investigated.
Fumiaki Kimino, Ryoma Sato Sokendai, National Institute of Informatics· 1 citation
A Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of-Distribution detection (termed HGOOD), which constructs two branches to hierarchically mine graph compact semantics in a comprehensive manner and introduces a cross-branch prototype contrast that aligns the captured graph patterns with their cr...
Xuan-Ting Fan, Chen-Yu Wang, Yue-Yue Gao et al.· Proceedings of the Thirty-Fi...· 0 citations
Experiments on synthetic and real-world datasets show that ORExplainer consistently provides more robust explanations across diverse node-level OOD settings, outperforming existing baselines.
Geonhee Han, Heesoo Jung, Hyunju Kang et al.· Proceedings of the 32nd ACM...· 0 citations
This study introduces a novel memory-augmented self-learning framework that extracts and provides diverse learning sources for adaptive knowledge distillation from the student model itself, resulting in a 2.5-6% increase in accuracy across various benchmark datasets compared to current GNN training and self-distillatio...
Saurabh Sharma, Souvik Chowdhury, Joydeep Chandra· Data mining and knowledge di...· 0 citations
This work proposes SeeExplainer, a parameter-free explainer to interpret graph neural networks, and introduces a granular-ball graph refinement mechanism that decomposes a graph into several disjoint granular-balls with no fixed size, and utilizes them as nodes to construct a structural graph.
Jian-Cu Chen, Shuyin Xia, Guan Wang et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.