Skip to content

Controllable GNN Explanations via Multi-Metric Preference Selection

Sep 2026 · 0 citations · 23 references
Computer Science

TL;DR

This work proposes a novel approach that optimizes GNN explanations across metrics, exposing their relative weighing as a control, and explores how, given an input motif library containing standard motifs for the corresponding domain, the method can be used to determine the relative importance of those motifs.

Abstract

Mechanisms for generating GNN explanations are crucial for building trust and mitigating biases in Graph Neural Networks (GNNs), especially in high-stakes scenarios. Most current methods optimize only for fidelity under the sparsity constraint. However, this discounts the need for interpretable explanations (those that consist of familiar motif patterns) and stable explanations (those that remain unchanged under structural perturbations). We propose a novel approach that optimizes GNN explanations across these metrics, exposing their relative weighing as a control. Experiments on various real-world datasets, including MUTAG, BA-2Motif, BAMultiShapes, and PROTEINS, suggest that our method produces higher-fidelity explanations than a state-of-the-art baseline on MUTAG and PROTEINS across all evaluated budgets, and on BA-2Motif at larger budgets, while being faster in the regime of small explanation budgets. We also explore how, given an input motif library containing standard motifs for the corresponding domain, the method can be used to determine the relative importance of those motifs in generating the explanations, and how this information can be used to further improve the quality of the output explanations. We also examine the relationship between different metrics through their induced tradeoff surface, and explore its dependence on the nature of the motif library.

View source

Similar papers

Conference Open access Sep 2026

HyperXRec: Unifying Preference Clusters and LLM Experts for Robust Explainable Recommendations

HyperXRec is a novel framework that unifies preference modeling and explanation generation by integrating hyperspherical latent clustering with a cluster-guided mixture-of-experts (MoE) inside an LLM, resulting in stable and semantically coherent clusters even under sparse interaction settings.

Xue Han, Zhi Luo, Zhi-Xiang Li et al. · 0 citations
#machine learning Preprint Sep 2026

A Systematic Benchmark of Explainable Methods for Temporal Attribution in Sequential Recommendation Systems

Sequential RecSys are central to modern personalization, exploiting user's historical interaction sequences to drive next-step decisions. Deep learning models, particularly CNN and Transformer-based architectures, have proven highly effective at capturing temporal dependencies in these histories. For transparency and t...

Akash Pandey, Kanisha Shah, Addrish Roy et al. · 0 citations
#machine learning Preprint Sep 2026

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

Counterfactual explanations for graph-structured data seek to determine minimal and realistic modifications required in an input graph to alter a model's prediction to a predefined output. Although counterfactual explainers that support modifying the graph by both adding and removing edges have recently emerged, there...

Maria Myrto Villia, Filippos Gouidis, T. Patkos et al. · 0 citations
Open access Aug 2026

CGCLER: Causality-Enhanced Graph Contrastive Learning for Explainable Recommendation

Cusality-enhanced Graph Contrastive Learning for Explainable Recommendation (CGCLER) is proposed, which enables item–explanation joint ranking by distinguishing causal and confounding features at the graph-node representation level and introduces a backdoor-inspired graph contrastive learning objective.

Ying Guan, Zhiwen Yang, Mengtao Duan · 0 citations

Fair Graph Learning Needs Expressiveness: Rethinking Fairness from the Spectral Perspective

It is formally proved that GNN architectures lacking spectral expressiveness impose strict constraints on the representation space, so that harmful linear correlations between sensitive attributes and target prediction logits are preserved whenever a low-expressive backbone is paired with a debiasing operator acting wi...

Ming-Qi Yang, Zhao-Yu Liu · 0 citations
Nov 2026

Explainability-Aligned Attributed Graph Generation

Data simulation is an established methodology in data engineering for augmenting limited datasets and safeguarding privacy, particularly for attributed graphs in domains such as finance and social networks. While existing methods successfully replicate topological and attribute distributions (statistical fidelity), we...

Zi-Cai Zhou, Xu Cheng, Guang Chen et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.