arXiv AI

Overcoming Shortcut Learning in Graph Neural Networks through Active Explanation Guidance

arXiv:2608. 14121v1 Announce Type: cross 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.

arXiv Machine Learning
Sep 7

A Comparative Study of Counterfactual Explainers for Graph Neural Networks Enabling Multiple Types of Graph Edit

The paper presents a comparative analysis of six state‑of‑the‑art counterfactual explainers for graph neural networks, focusing on methods that can both add and remove edges to alter model predictions. It evaluates these explainers across diverse real‑world and synthetic datasets, covering binary and multi‑class graph and node classification tasks, using a range of quantitative and qualitative metrics. The study highlights the trade‑offs between explanation size, coverage, and quality, aiming to pinpoint each method’s strengths and weaknesses to inform future research.

By Maria Myrto Villia, Filippos Gouidis, Theodore Patkos, Panos Trahanias