9 citations · 40 across the 25 of their papers we have counts for
21 papers · 1 filter
Overcoming Shortcut Learning in Graph Neural Networks through Active Explanation Guidance
Taraneh Younesian, Steve Azzolin, Antonio Longa +3
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…
GNN Explanations that do not Explain and How to find Them
Steve Azzolin, Stefano Teso, Bruno Lepri +2
Explanations provided by Self-explainable Graph Neural Networks (SE-GNNs) are fundamental for understanding the model's inner workings and for identifying potential misuse of sensi…
Shortcuts and Identifiability in Concept-based Models from a Neuro-Symbolic Lens
Samuele Bortolotti, Emanuele Marconato, Paolo Morettin +2
Concept-based Models are neural networks that learn a concept extractor to map inputs to high-level concepts and an inference layer to translate these into predictions. Ensuring th…
Beyond Topological Self-Explainable GNNs: A Formal Explainability Perspective
Steve Azzolin, Sagar Malhotra, Andrea Passerini +1
Self-Explainable Graph Neural Networks (SE-GNNs) are popular explainable-by-design GNNs, but their explanations' properties and limitations are not well understood. Our first contr…
Time Can Invalidate Algorithmic Recourse
Giovanni De Toni, Stefano Teso, Bruno Lepri +1
Algorithmic Recourse (AR) aims to provide users with actionable steps to overturn unfavourable decisions made by machine learning predictors. However, these actions often take time…
Reconsidering Faithfulness in Regular, Self-Explainable and Domain Invariant GNNs
Steve Azzolin, Antonio Longa, Stefano Teso +1
As Graph Neural Networks (GNNs) become more pervasive, it becomes paramount to build reliable tools for explaining their predictions. A core desideratum is that explanations are \t…