REVIEW 2 cited by
Robust Ante-hoc Graph Explainer using Bilevel Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Explaining the decisions made by machine learning models for high-stakes applications is critical for increasing transparency and guiding improvements to these decisions. This is particularly true in the case of models for graphs, where decisions often depend on complex patterns combining rich structural and attribute data. While recent work has focused on designing so-called post-hoc explainers, the broader question of what constitutes a good explanation remains open. One intuitive property is that explanations should be sufficiently informative to reproduce the predictions given the data. In other words, a good explainer can be repurposed as a predictor. Post-hoc explainers do not achieve this goal as their explanations are highly dependent on fixed model parameters (e.g., learned GNN weights). To address this challenge, we propose RAGE (Robust Ante-hoc Graph Explainer), a novel and flexible ante-hoc explainer designed to discover explanations for graph neural networks using bilevel optimization, with a focus on the chemical domain. RAGE can effectively identify molecular substructures that contain the full information needed for prediction while enabling users to rank these explanations in terms of relevance. Our experiments on various molecular classification tasks show that RAGE explanations are better than existing post-hoc and ante-hoc approaches.
Forward citations
Cited by 2 Pith papers
-
Automorphism-Induced Non-Canonicity in Top-k Explanations of Graph Neural Networks
On symmetric graphs, an exact-k GNN explanation cannot be simultaneously single-valued, minimal, and symmetry-respecting, so any report naming one edge from an automorphism orbit is an arbitrary tie-break.
-
Evaluating Data Influence in Meta Learning
The paper derives closed-form influence functions that estimate the effect of removing tasks or instances on meta-learning parameters in bilevel optimization.
Discussion (0). Continue with ORCID to comment.