Towards Faithful and Consistent Explanations for Graph Neural Networks

TL;DR

This paper addresses the issue of spurious and inconsistent explanations in graph neural networks by analyzing their predictions from a causality perspective and proposing an embedding alignment method to improve explanation faithfulness.

Contribution

It introduces a causality-based analysis of GNN explanations and proposes a distribution-aware embedding alignment technique to enhance explanation consistency and faithfulness.

Findings

The proposed method improves explanation faithfulness in GNNs.

Theoretical analysis supports the effectiveness of embedding alignment.

The approach is easy to integrate with existing explanation techniques.

Abstract

Uncovering rationales behind predictions of graph neural networks (GNNs) has received increasing attention over recent years. Instance-level GNN explanation aims to discover critical input elements, like nodes or edges, that the target GNN relies upon for making predictions. Though various algorithms are proposed, most of them formalize this task by searching the minimal subgraph which can preserve original predictions. However, an inductive bias is deep-rooted in this framework: several subgraphs can result in the same or similar outputs as the original graphs. Consequently, they have the danger of providing spurious explanations and fail to provide consistent explanations. Applying them to explain weakly-performed GNNs would further amplify these issues. To address this problem, we theoretically examine the predictions of GNNs from the causality perspective. Two typical reasons of spurious explanations are identified: confounding effect of latent variables like distribution shift, and causal factors distinct from the original input. Observing that both confounding effects and diverse causal rationales are encoded in internal representations, we propose a simple yet effective countermeasure by aligning embeddings. Concretely, concerning potential shifts in the high-dimensional space, we design a distribution-aware alignment algorithm based on anchors. This new objective is easy to compute and can be incorporated into existing techniques with no or little effort. Theoretical analysis shows that it is in effect optimizing a more faithful explanation objective in design, which further justifies the proposed approach.