- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes CIExplainer++, a causal explanation framework for GNNs. It targets three problems in existing methods: reliance on data correlations, limited insight into underlying causal mechanisms, and subgraphs that are hard for non-experts to interpret. The framework include 3 modules. CIExplainer uses a potential outcome model to intervene on node features, estimate the model-level causal effect, and select the nodes with the strongest effects to form a causal explanation subgraph. It supports node classification, graph classification, and link prediction. G2TeXplainer converts the structured subgraph into natural language with 4 progressive prompting strategies; The third module combines LLM-as-judge with human evaluation to measure explanation quality across multiple dimensions. Experiments use 4 standard datasets, 4 GNNs, and 7 competing methods. CIExplainer leads on node classification accuracy and inference speed and remains competitive on graph classification. G2TeXplainer with P4 performs best in both automatic and human evaluation. Ablations support the design choices behind max aggregation and the Gaussian mixture counterfactual distribution. The authors also note limitations related to sampling range, distribution assumptions, and evaluation bias.
Critical strengths
The paper brings the potential outcome framework into GNN interpretation and replaces correlation-based attribution with causal intervention. CIExplainer does not simply identify nodes or edges associated with a prediction,it intervenes on node features, estimates the model-level effect on the output, and uses that effect to select an explanation subgraph.The approach is more principled than traditional methods and can be extended to node classification, graph classification, and link prediction.
Critical weaknesses
The paper’s core component CIExplainer defines the node feature intervention effect as a causal effect within the potential outcome framework. This framing runs into a problem with GNN message passing: changing one node’s features changes its representation, which then propagates layer by layer and can affect neighboring nodes and the target node. The target outcome therefore depends on both its own treatment and the treatment of other nodes. The paper tests temporal stability and causal transience, but it still treats the target node’s K-hop computation graph as a closed unit, assuming that outside nodes remain unaffected and that units do not interfere. That assumption depends on the neighborhood sampling range and global graph connectivity, yet the paper provides no rigorous proof or multi-scenario empirical validation.
Questions for authors
1.Given that message passing can propagate an intervention beyond the target node’s K-hop computation graph(As mentioned in weakness), how do the authors justify treating that K-hop graph as a closed unit satisfying SUTVA/no-interferences?
2.Given that G2TeXplainer and LLM-as-judge build on existing work, and the authors also acknowledge limitations of LLMs, should these two modules be repositioned as auxiliary components rather than co-equal contributions alongside CIExplainer? The current version presents them as equally important, which may obscure the paper’s core innovation.
2 comments
Thank you for your Review
Thank you again for your review. Following our reply of 10 November, we have uploaded the revised manuscript, with changes marked in blue.
The method section now explains what is held fixed during feature interventions and the conditions under which the K-hop computation graph contains the dependencies of the target prediction. The introduction also presents CIExplainer as the main method, G2TeXplainer as a secondary component, and LLM-as-judge as part of the evaluation.
Please let us know if either point still needs clarification.
We thank the reviewer for identifying these points. We have revised the corresponding explanations and expect to upload a consolidated manuscript revision on Thursday, 12 November, incorporating the additional experimental results and marking changes in blue.
Thank you for raising this point. We agree that the conditions supporting the computation-graph restriction should be explicit. We have revised the text to distinguish sampling feature values from neighborhood sampling and to clarify that the neighborhood remains fixed throughout the counterfactual evaluations.
Our unit is the explanation instance (G,v,w,i) defined in Section 3.3. The treatment replaces feature i of node w, and the outcome is the target-class score at node v. The original and intervened outcomes are evaluated with the same trained GNN and graph structure, with all remaining input features held fixed. Message passing between nodes within this instance is part of the mechanism through which the intervention affects the target outcome.
For the node-classification GNNs considered, the K-hop neighborhood is determined by the number of local message-passing layers. The computation graph includes the feature dependencies within this receptive field. The neighborhood is selected once and held fixed throughout the counterfactual evaluations. Feature interventions change the messages along existing paths without adding edges or message-passing layers. Although an intervention can affect other node predictions, this does not introduce additional feature dependencies into the target’s K layer computation.
We have revised the text to clarify these conditions. In particular, the sampling limitation discussed in the paper concerns sampling replacement feature values. The neighborhood is not resampled between counterfactual evaluations. We have also stated that restricting the computation to a neighborhood requires knowledge of the GNN’s receptive field.
We agree that CIExplainer is the main methodological contribution. We have revised the introduction to present G2TeXplainer as a secondary component that produces natural language descriptions of the explanation subgraphs, with the aim of making the selected nodes and their relationships easier to interpret.
LLM-as-judge is presented as an evaluation procedure, complemented by human evaluation. Its scores assess the generated descriptions under the stated criteria. We have revised the presentation to distinguish this evaluation procedure from the methodological contribution of CIExplainer.
We would be happy to address any further questions.