REVIEW 3 cited by
Parameterized Explainer for Graph Neural Network
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
Despite recent progress in Graph Neural Networks (GNNs), explaining predictions made by GNNs remains a challenging open problem. The leading method independently addresses the local explanations (i.e., important subgraph structure and node features) to interpret why a GNN model makes the prediction for a single instance, e.g. a node or a graph. As a result, the explanation generated is painstakingly customized for each instance. The unique explanation interpreting each instance independently is not sufficient to provide a global understanding of the learned GNN model, leading to a lack of generalizability and hindering it from being used in the inductive setting. Besides, as it is designed for explaining a single instance, it is challenging to explain a set of instances naturally (e.g., graphs of a given class). In this study, we address these key challenges and propose PGExplainer, a parameterized explainer for GNNs. PGExplainer adopts a deep neural network to parameterize the generation process of explanations, which enables PGExplainer a natural approach to explaining multiple instances collectively. Compared to the existing work, PGExplainer has better generalization ability and can be utilized in an inductive setting easily. Experiments on both synthetic and real-life datasets show highly competitive performance with up to 24.7\% relative improvement in AUC on explaining graph classification over the leading baseline.
Forward citations
Cited by 3 Pith papers
-
Improving Molecular Property Prediction in Small Language Models Using Graph-based Tools
Augmenting SLM prompts with a GNN expert's prediction, confidence, and an extracted important subgraph improves zero-shot toxicity/mutagenicity accuracy on MUTAG and Tox21, with gains up to 74% relative to SMILES-only...
-
Structure-Aware Compound-Protein Affinity Prediction via Graph Neural Networks with Group Lasso Regularization
Adding common-plus-uncommon substructure masks and group lasso or sparse group lasso losses to activity-cliff GNNs improves per-target pIC50 prediction and attribution consistency on six tyrosine kinases.
-
PyG 2.0: Scalable Learning on Real World Graphs
PyG 2.0 is presented as a modular, scalable graph-learning framework with heterogeneous and temporal graph support, compilation-based speedups, and explainability.
Discussion (0). Continue with ORCID to comment.