Iterative Graph Neural Network Enhancement Using Explanations

Tamas Horvath, Harish Naik, Raj Shekhar, Gyorgy Turan

Keywords: Graph Neural Network, Explainable AI, Frequent Subgraph Mining, Weisfeiler-Leman

Abstract: We formulate an XAI-based model improvement approach for Graph Neural Networks (GNN) for node classification, called Explanation Enhanced Graph Learning (EEGL). The goal is to improve predictive performance using explanations. EEGL is an iterative algorithm, which starts with a learned “vanilla” GNN and repeatedly uses frequent subgraph mining to find relevant patterns in explanation subgraphs, which are then analyzed further to obtain application-dependent features corresponding to the presence of certain subgraphs in the node neighborhoods. Giving an application-dependent algorithm for such an extension of the Weisfeiler-Leman (1-WL) algorithm has been posed as an open problem. We present the results of experiments on different synthetic datasets, compare them with other feature annotations, and analyse the training dynamics.

Primary Area: learning on graphs and other geometries & topologies

Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.

Submission Guidelines: I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2024/AuthorGuide.

Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors' identity.

No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.

Submission Number: 7471