MEGAN: Multi-Explanation Graph Attention Network
Jonas Teufel, Luca Torresi, Patrick Reiser, Pascal Friederich
TL;DR
This work tackles the challenge of explaining graph predictions, especially for graph regression where explanations must capture opposing motif effects. It introduces MEGAN, a multi channel graph attention network that produces K explanation channels for nodes and edges and jointly trains explanations with the main task through explanation co training. Across synthetic and real world datasets, MEGAN achieves high explanation fidelity and, when trained in an explanation supervised manner, near perfect alignment with ground truth explanations, while maintaining strong predictive performance. The approach enhances interpretability by separating evidence polarity into multiple channels and provides a practical framework for assessing and validating explanations via Fidelity* metrics, with potential to reveal new structure property relationships in graphs.
Abstract
We propose a multi-explanation graph attention network (MEGAN). Unlike existing graph explainability methods, our network can produce node and edge attributional explanations along multiple channels, the number of which is independent of task specifications. This proves crucial to improve the interpretability of graph regression predictions, as explanations can be split into positive and negative evidence w.r.t to a reference value. Additionally, our attention-based network is fully differentiable and explanations can actively be trained in an explanation-supervised manner. We first validate our model on a synthetic graph regression dataset with known ground-truth explanations. Our network outperforms existing baseline explainability methods for the single- as well as the multi-explanation case, achieving near-perfect explanation accuracy during explanation supervision. Finally, we demonstrate our model's capabilities on multiple real-world datasets. We find that our model produces sparse high-fidelity explanations consistent with human intuition about those tasks.
