Faithful and Accurate Self-Attention Attribution for Message Passing Neural Networks via the Computation Tree Viewpoint
Yong-Min Shin, Siqing Li, Xin Cao, Won-Yong Shin
Abstract
The self-attention mechanism has been adopted in various popular message passing neural networks (MPNNs), enabling the model to adaptively control the amount of information that flows along the edges of the underlying graph. Such attention-based MPNNs (Att-GNNs) have also been used as a baseline for multiple studies on explainable AI (XAI) since attention has steadily been seen as natural model interpretations, while being a viewpoint that has already been popularized in other domains (e.g., natural language processing and computer vision). However, existing studies often use naïve calculations to derive attribution scores from attention, undermining the potential of attention as interpretations for Att-GNNs. In our study, we aim to fill the gap between the widespread usage of Att-GNNs and their potential explainability via attention. To this end, we propose GATT, edge attribution calculation method for self-attention MPNNs based on the computation tree, a rooted tree that reflects the computation process of the underlying model. Despite its simplicity, we empirically demonstrate the effectiveness of GATT in three aspects of model explanation: faithfulness, explanation accuracy, and case studies by using both synthetic and realworld benchmark datasets. In all cases, the results demonstrate that GATT greatly improves edge attribution scores, especially compared to the previous naïve approach. Our code is available at https://github.com/jordan7186/GAtt .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on22
- Emerging Properties in Self-Supervised Vision TransformersMathilde Caron, Hugo Touvron, Ishan Misra, Hervé Jégou et al.ICCV 2021 · 8,921 citations
- How Attentive are Graph Attention Networks?Shaked Brody, Uri Alon, Eran YahavICLR 2022 · 1,717 citations
- Do Transformers Really Perform Badly for Graph Representation?Chengxuan Ying, Tianle Cai, Shengjie Luo, Shuxin Zheng et al.NeurIPS 2021 · 1,632 citations
- Rethinking Graph Transformers with Spectral AttentionDevin Kreuzer, Dominique Beaini, William L. Hamilton, Vincent Létourneau et al.NeurIPS 2021 · 854 citations
- Generic Attention-model Explainability for Interpreting Bi-Modal and Encoder-Decoder TransformersHila Chefer, Shir Gur, Lior WolfICCV 2021 · 451 citations
Related papers
- Efficient Computation of Higher-Order Subgraph Attribution via Message PassingPing Xiong, Thomas Schnake, Grégoire Montavon, Klaus-Robert Müller et al.ICML 2022 · 15 citations
- Revelio: Revealing Important Message Flows in Graph Neural NetworksHaoyu He, Isaiah J. King, H. Howie HuangICDE 2025 · 1 citation
- Evaluating Attribution for Graph Neural NetworksBenjamín Sánchez-Lengeling, Jennifer N. Wei, Brian K. Lee, Emily Reif et al.NeurIPS 2020 · 159 citations
- Explanations of GNN on Evolving Graphs via Axiomatic Layer edgesYazheng Liu, Sihong XieICLR 2025
- DEGREE: Decomposition Based Explanation for Graph Neural NetworksQizhang Feng, Ninghao Liu, Fan Yang, Ruixiang Tang et al.ICLR 2022 · 33 citations
