Empower Post-hoc Graph Explanations with Information Bottleneck: A Pre-training and Fine-tuning Perspective
Jihong Wang, Minnan Luo, Jundong Li, Yun Lin, Yushun Dong, Jin Song Dong, Qinghua Zheng
摘要
Researchers recently investigated to explain Graph Neural Networks (GNNs) on the access to a task-specific GNN, which may hinder their wide applications in practice. Specifically, task-specific explanation methods are incapable of explaining pretrained GNNs whose downstream tasks are usually inaccessible, not to mention giving explanations for the transferable knowledge in pretrained GNNs. Additionally, task-specific methods only consider target models' output in the label space, which are coarse-grained and insufficient to reflect the model's internal logic. To address these limitations, we consider a two-stage explanation strategy, i.e., explainers are first pretrained in a task-agnostic fashion in the representation space and then further fine-tuned in the task-specific label space and representation space jointly if downstream tasks are accessible. The two-stage explanation strategy endows post-hoc graph explanations with the applicability to pretrained GNNs where downstream tasks are inaccessible and the capacity to explain the transferable knowledge in the pretrained GNNs. Moreover, as the two-stage explanation strategy explains the GNNs in the representation space, the fine-grained information in the representation space also empowers the explanations. Furthermore, to achieve a trade-off between the fidelity and intelligibility of explanations, we propose an explanation framework based on the Information Bottleneck principle, named Explainable Graph Information Bottleneck (EGIB). EGIB subsumes the task-specific explanation and task-agnostic explanation into a unified framework. To optimize EGIB objective, we derive a tractable bound and adopt a simple yet effective explanation generation architecture. Based on the unified framework, we further theoretically prove that task-agnostic explanation is a relaxed sufficient condition of task-specific explanation, which indicates the transferability of task-agnostic explanations. Extensive experimental results demonstrate the effectiveness of our proposed explanation method.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- I3-MRec: Invariant Learning with Information Bottleneck for Incomplete Modality RecommendationHuilin Chen, Miaomiao Cai, Fan Liu, Zhiyong Cheng 等ACM MM 2025 · 被引用 1 次
- Paradigm Shift of GNN Explainer from Label Space to Prototypical Representation SpaceJun Yin, Senzhang Wang, Ziluowen Luo, Peng Huo 等ICLR 2026
它引用的顶会 Paper11
- Strategies for Pre-training Graph Neural NetworksWeihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik 等ICLR 2020 · 被引用 1,744 次
- InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information MaximizationFan-Yun Sun, Jordan Hoffmann, Vikas Verma, Jian TangICLR 2020 · 被引用 1,010 次
- Parameterized Explainer for Graph Neural NetworkDongsheng Luo, Wei Cheng, Dongkuan Xu, Wenchao Yu 等NeurIPS 2020 · 被引用 888 次
- On Mutual Information Maximization for Representation LearningMichael Tschannen, Josip Djolonga, Paul K. Rubenstein, Sylvain Gelly 等ICLR 2020 · 被引用 559 次
- On Explainability of Graph Neural Networks via Subgraph ExplorationsHao Yuan, Haiyang Yu, Jie Wang, Kang Li 等ICML 2021 · 被引用 498 次
相关 Paper
- Factorized Explainer for Graph Neural NetworksRundong Huang, Farhad Shirani, Dongsheng LuoAAAI 2024 · 被引用 16 次
- Is Your Explanation Reliable: Confidence-Aware Explanation on Graph Neural NetworksJiaxing Zhang, Xiaoou Liu, Dongsheng Luo, Hua WeiKDD 2025 · 被引用 1 次
- Self-Explainable Temporal Graph Networks based on Graph Information BottleneckSangwoo Seo, Sungwon Kim, Jihyeong Jung, Yoonho Lee 等KDD 2024 · 被引用 5 次
- MixupExplainer: Generalizing Explanations for Graph Neural Networks with Data AugmentationJiaxing Zhang, Dongsheng Luo, Hua WeiKDD 2023 · 被引用 20 次
- Interpretable Prototype-based Graph Information BottleneckSangwoo Seo, Sungwon Kim, Chanyoung ParkNeurIPS 2023 · 被引用 47 次
