Pith. sign in

REVIEW 3 cited by

Faithful Interpretation for Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.06950 v1 pith:GOM2DJO7 submitted 2024-10-09 cs.LG cs.AI

classification cs.LGcs.AI
keywords graphfgaiattentioninterpretationattention-basedfaithfulgnnsnetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Currently, attention mechanisms have garnered increasing attention in Graph Neural Networks (GNNs), such as Graph Attention Networks (GATs) and Graph Transformers (GTs). It is not only due to the commendable boost in performance they offer but also its capacity to provide a more lucid rationale for model behaviors, which are often viewed as inscrutable. However, Attention-based GNNs have demonstrated instability in interpretability when subjected to various sources of perturbations during both training and testing phases, including factors like additional edges or nodes. In this paper, we propose a solution to this problem by introducing a novel notion called Faithful Graph Attention-based Interpretation (FGAI). In particular, FGAI has four crucial properties regarding stability and sensitivity to interpretation and final output distribution. Built upon this notion, we propose an efficient methodology for obtaining FGAI, which can be viewed as an ad hoc modification to the canonical Attention-based GNNs. To validate our proposed solution, we introduce two novel metrics tailored for graph interpretation assessment. Experimental results demonstrate that FGAI exhibits superior stability and preserves the interpretability of attention under various forms of perturbations and randomness, which makes FGAI a more faithful and reliable explanation tool.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment

    cs.LG 2025-06 conditional novelty 6.0 of 10

    GAGA matches or exceeds state-of-the-art accuracy on several text-attributed graph benchmarks while requiring large language model annotations for only 1% of nodes or edges.

  2. Understanding and Mitigating Cross-lingual Privacy Leakage via Language-specific and Universal Privacy Neurons

    cs.CL 2025-06 reject novelty 6.0 of 10

    Cross-lingual privacy leakage in LLMs is driven by a mix of language-universal and language-specific neurons, and deactivating those neurons lowers measured leakage by 23.3% to 31.6%.

  3. Stable Vision Concept Transformers for Medical Diagnosis

    cs.CV 2025-06 reject novelty 4.0 of 10

    A vision transformer with a concept bottleneck and denoised diffusion smoothing is claimed to give stable concept explanations under input perturbations while keeping diagnostic accuracy.

Pith tools