- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes ReCoGU, a graph unlearning framework that reduces retraining costs through retention-aware graph coarsening. It constructs label-pure training units, maintains locally updatable graph statistics, and retrains GNNs on the updated coarsened graph. The paper further introduces collateral utility loss (CUL) and derives a theoretical bound relating prediction distortion to retained-data utility. Experiments across five datasets and three GNN backbones demonstrate promising efficiency and classification performance.
Critical strengths
-
The paper addresses the important trade-off between unlearning efficiency and retained-data utility. The use of locally updated coarsened graphs provides a practical approach to reducing retraining costs.
-
The introduction of CUL and its decomposition into prediction distortion, supervision-weight correction, and optimization error provides a useful perspective for analyzing the effects of graph coarsening.
Critical weaknesses
-
What is the fundamental technical novelty of ReCoGU beyond combining existing coarsening, local statistics updates, and weighted retraining? The paper should more clearly identify the limitations of previous coarsening-based unlearning methods and explain why the proposed components are necessary. More targeted comparisons and ablations would help distinguish the proposed contributions from existing approaches.
-
Does the fixed partition truly eliminate the influence of deleted nodes?
A central design choice is to construct the initial label-pure partition using the original training graph and reuse it after unlearning requests. However, the initial partition depends on node features, labels, and graph structure, including information from nodes that may subsequently be deleted.
Although the proposed local updates remove deleted nodes from feature sums and edge statistics, their influence may remain indirectly through the fixed partition and surviving node assignments.
How can the authors ensure that the deleted nodes no longer influence the resulting model through the original partition? Could the authors compare the current approach against constructing a new partition directly from the retained graph? This distinction is important for establishing the validity of the proposed unlearning procedure.
- Insufficient justification for square-root unit-size weighting.
The method assigns each coarsened unit a loss weight proportional to the square root of its size. However, the theoretical analysis does not establish why this weighting is preferable to uniform weighting or weighting proportional to the original number of nodes.
Why is square-root weighting chosen, and how important is it to the reported performance? Could the authors provide comparisons with alternative weighting strategies and analyze how they affect CUL, classification accuracy, and class imbalance?
Questions for authors
See weakness
2 comments
Thanks for the response. I still think the paper does not clearly explain the difference between graph unlearning and graph continual learning, and it does not present a specific challenge in the graph unlearning problem. moreover, as the paper described in the Introduction: "combining label-pure training units, structurally merging units that share the same label, performing local updates on retained statistics, and applying a square-root weighting scheme based on unit size” seems overly focused on engineering details. Still, the paper should at least have one paragraph of related work. I think this is an unfinished paper, but has its potential. I will keep myscore slightly lower the borderline
Thanks
Once again, we sincerely thank you for your valuable comments and requested experiments. We hope that our responses have adequately addressed all of your concerns. We would be happy to address any further questions or provide additional carification regarding the novelty and contributions of our work.