Iterative Graph Neural Network Enhancement Using Explanations
Tamas Horvath, Harish Naik, Raj Shekhar, Gyorgy Turan
OpenReview ground truth
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.
Author context
Most prolific author: 1 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 30 comparisons
Ranked above opponent in 39% of matchups.
- ▲ beat NDIM: Neuronal Diversity Inspired Model fo… ×6
- ▼ lost to OWL: A Large Language Model for IT Operati… ×6
- ▼ lost to On the Hidden Waves of Image ×6
- ▲ beat Impact of Molecular Representations on Dee… ×6
- ▼ lost to Network Alignment with Transferable Graph … ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 30)