- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes structural counterfactual explanations for node classification with hypergraph neural networks. It argues that the only existing hypergraph counterfactual method, CF-HyperGNNExplainer, is limited to deleting incidences, so it can only sparsify a target node’s original memberships. The authors propose HyperCF, which lets a target node both leave its current hyperedges and join existing nearby hyperedges through a single soft incidence mask. To make this search tractable, HyperCF restricts additions to nearby hyperedges, uses a smaller learning rate for additions, and prunes redundant edits. On seven benchmarks, it improves success over the deletion-only baseline on most datasets with similar or smaller explanation sizes, but underperforms on DBLP-CA.
Critical strengths
1.Clear and well-motivated problem. The paper identifies a concrete limitation of existing hypergraph counterfactual methods: deletion-only search can only sparsify a node’s original memberships.
2.Clean ablation of the pruning step. The ablation toggles only the pruning step on the same node set and reports deletions and additions separately, which cleanly isolates its effect.
3.Native incidence-level design. HyperCF edits the incidence matrix directly without star expansion.
Critical weaknesses
1.Limited novelty. The method mainly transfers existing bidirectional editing and pruning ideas from pairwise graphs to hypergraph incidences, building on CF-HyperGNNExplainer for hypergraph counterfactual search, and the paper itself acknowledges in Section 1 that these ideas already exist for pairwise edges.
2.Lack of theoretical analysis. The paper does not analyze when joining existing hyperedges can flip a prediction that deletions cannot, so the benefit of additions is shown only empirically, and the failure on DBLP-CA is explained only by speculation.
3.Large gap between pruned and unpruned explanations. Without pruning, explanation sizes on Pubmed and Mushroom reach 23.26 and 29.93 edits, compared with 7.06 and 3.81 after pruning, and the authors should explain why the search itself produces so many redundant edits.
4.Plausibility of added incidences. The paper does not evaluate whether adding a node to an existing hyperedge yields a realistic or meaningful counterfactual, so it is unclear whether the gains reflect useful explanations or implausible edits.
5.Limited experimental reliability. Experiments use only one HGNN backbone and report no standard deviations, so it is unclear whether the method generalizes and whether small gains are significant.
Questions for authors
(1) Why are unpruned explanations so large on Pubmed and Mushroom?
(2) How do you ensure that added incidences are plausible?
(3) Can you report standard deviations and results on another HGNN backbone?