As one of the most popular machine learning models today, graph neural networks (GNNs) have attracted intense interest recently, and so does their explainability. Users are increasingly interested in a better understanding of GNN models and their outcomes. Unfortunately, today's evaluation frameworks for GNN explainability often rely on few inadequate synthetic datasets, leading to conclusions of limited scope due to a lack of complexity in the problem instances. As GNN models are deployed to more mission-critical applications, we are in dire need for a common evaluation protocol of explainability methods of GNNs. In this paper, we propose, to our best knowledge, the first systematic evaluation framework for GNN explainability, considering explainability on three different "user needs". We propose a unique metric that combines the fidelity measures and classifies explanations based on their quality of being sufficient or necessary. We scope ourselves to node classification tasks and compare the most representative techniques in the field of input-level explainability for GNNs. For the inadequate but widely used synthetic benchmarks, surprisingly shallow techniques such as personalized PageRank have the best performance for a minimum computation time. But when the graph structure is more complex and nodes have meaningful features, gradient-based methods are the best according to our evaluation criteria. However, none dominates the others on all evaluation dimensions and there is always a trade-off. We further apply our evaluation protocol in a case study for frauds explanation on eBay transaction graphs to reflect the production environment.
Parallelizing Node-Level Explainability in Graph Neural Networks
Ericsson Cognitive Labs(爱立信认知实验室);Institute for Research in Technology (IIT), ICAI School of Engineering, Comillas Pontifical University(技术研究所(IIT)、ICAI工程学院、科利马大学)
A Completion-Aware Framework for Impactful Counterfactual Explainability in Graph Neural Networks
Institute of Computer Science, Foundation for Research and Technology - Hellas (FORTH)(计算机科学研究所,研究与技术基金会 - 希腊(FORTH));Computer Science Department, University of Crete(克里特大学计算机科学系)
Evaluating Explainability for Graph Neural Networks
Adobe(奥多比公司);University of Tennessee(田纳西大学);Harvard Business School(哈佛商学院);Harvard University(哈佛大学);Broad Institute of MIT and Harvard(麻省理工学院和哈佛大学博德研究所);Harvard Data Science Initiative(哈佛数据科学研究院)
A Survey on Explainability of Graph Neural Networks
University of Illinois Chicago(伊利诺伊大学芝加哥分校);Georgia Institute of Technology(佐治亚理工学院);IBM T. J. Watson Research Center(IBM托马斯·J·沃森研究中心);University of Illinois, Chicago(伊利诺伊大学芝加哥分校)
Explainability of Recurrent Neural Networks for Enhancing P300-based Brain-Computer Interfaces
Grupo de Neurocomputación Biológica, Departamento de Ingeniería Informática, Escuela Politécnica Superior, Universidad Autónoma de Madrid(生物神经计算组,信息工程系,理工大学高级学院,马德里自治大学);Grupo de Investigación en Electrónica y Telemática, Universidad Politécnica Salesiana(电子与电信研究组,萨利纳斯理工大学)
Towards Robust Fidelity for Evaluating Explainability of Graph Neural Networks
School of Computing and Information Sciences, Florida International University(佛罗里达国际大学计算与信息科学学院);NEC Laboratories America(美国NEC实验室);School of Computing and Augmented Intelligence, Arizona State University(亚利桑那州立大学计算与增强智能学院)
A Systematic Literature Review on Explainability for Machine/Deep Learning-based Software Engineering Research
Yangzhou University(扬州大学);Singapore Management University(新加坡管理大学);University of Southern Queensland(南昆士兰大学);Washington University in St. Louis(圣路易斯华盛顿大学)
FlowX: Towards Explainable Graph Neural Networks via Message Flows
Texas A&M University(德克萨斯A&M大学);University of Science and Technology of China(中国科学技术大学);Beijing University of Posts and Telecommunications(北京邮电大学);West China Hospital(四川大学华西医院)
Hierarchical Pooling and Explainability in Graph Neural Networks for Tumor and Tissue-of-Origin Classification Using RNA-seq Data
Institute of Informatics(信息学院);Universidade Federal do Rio Grande do Sul(鲁汶联邦大学);Bioinformatics Core(生物信息学核心);Hospital de Clínicas de Porto Alegre(波多利亚临床医院)
GISExplainer: On Explainability of Graph Neural Networks via Game-theoretic Interaction Subgraphs
School of Cyber Security and Information Law, Chongqing University of Posts and Telecommunications(重庆邮电大学网络空间安全与信息法学院);School of Computer Science and Technology, Chongqing University of Posts and Telecommunications(重庆邮电大学计算机科学与技术学院);Chengdu University of Technology(成都理工大学);School of Software Engineering, Chengdu University of Information Technology(成都信息工程大学软件工程学院);School of Computer and Information Science, Chongqing Normal University(重庆师范大学计算机与信息科学学院)
A Meta-Learning Approach for Training Explainable Graph Neural Networks
Sapienza University of Rome(罗马大学)
本文研究了图神经网络的可解释性程度。现有的解释器通过寻找全局/局部子图来解释预测,但是它们是在GNN已经被训练之后应用的。在这里,我们提出了一个元学习框架,用于直接在训练时提高GNN的可解释性水平,通过将优化过程转向我们所谓的“可解释的极小值”。我们的框架(称为MATE,MetA-Train to Explain)联合训练模型来解决原始任务,例如,节点分类,并为下游算法提供易于处理的输出,以人性化的方式解释模型的决策。特别是,我们对模型的参数进行元训练,以快速最小化在随机采样节点上动态训练的实例级GNNExplainer的误差。最终的内部表示依赖于一组可以通过解释算法“更好”理解的特征,例如,另一个GNNExplainer实例。我们的模型无关方法可以改进为不同GNN架构生成的解释,并使用任何基于实例的解释器来驱动此过程。在用于节点和图分类的合成和真实世界数据集上进行的实验表明,我们可以生成更容易通过不同算法解释的模型。此外,这种可解释性的增加并没有牺牲模型的准确性。