PGM-Explainer: Probabilistic Graphical Model Explanations for Graph Neural Networks

被引:0
作者
Vu, Minh N. [1 ]
Thai, My T. [1 ]
机构
[1] Univ Florida, Gainesville, FL 32611 USA
来源
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020 | 2020年 / 33卷
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In Graph Neural Networks (GNNs), the graph structure is incorporated into the learning of node representations. This complex structure makes explaining GNNs' predictions become much more challenging. In this paper, we propose PGM-Explainer, a Probabilistic Graphical Model (PGM) model-agnostic explainer for GNNs. Given a prediction to be explained, PGM-Explainer identifies crucial graph components and generates an explanation in form of a PGM approximating that prediction. Different from existing explainers for GNNs where the explanations are drawn from a set of linear functions of explained features, PGM-Explainer is able to demonstrate the dependencies of explained features in form of conditional probabilities. Our theoretical analysis shows that the PGM generated by PGM-Explainer includes the Markov-blanket of the target prediction, i.e. including all its statistical information. We also show that the explanation returned by PGM-Explainer contains the same set of independence statements in the perfect map. Our experiments on both synthetic and real-world datasets show that PGM-Explainer achieves better performance than existing explainers in many benchmark tasks.
引用
收藏
页数:11
相关论文
共 40 条
[1]  
[Anonymous], 2018, Advances in Neural Information Processing Systems
[2]   On Pixel-Wise Explanations for Non-Linear Classifier Decisions by Layer-Wise Relevance Propagation [J].
Bach, Sebastian ;
Binder, Alexander ;
Montavon, Gregoire ;
Klauschen, Frederick ;
Mueller, Klaus-Robert ;
Samek, Wojciech .
PLOS ONE, 2015, 10 (07)
[3]  
Barabási AL, 2016, NETWORK SCIENCE, P1
[4]  
Defferrard M., 2016, Advances in Neural Information Processing Systems, DOI DOI 10.5555/3157382.3157527
[5]  
Doshi-Velez F., 2017, ARXIV170208608, V1702, P08608
[6]  
Dwivedi V.P., 2020, TSP
[7]   Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood [J].
Gamez, Jose A. ;
Mateo, Juan L. ;
Puerta, Jose M. .
DATA MINING AND KNOWLEDGE DISCOVERY, 2011, 22 (1-2) :106-148
[8]  
Hamilton W.L., 2017, ADV NEUR IN, P1025
[9]  
Jianming Z., 2016, EUR C COMP VIS ECCV
[10]  
Kingma DP., 2017, A method for stochastic optimization, DOI DOI 10.48550/ARXIV.1412.6980