- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
PLU-GT handles node-unlearning requests in a partitioned Graph Transformer with shared parameters by locating affected patches, remapping forgotten nodes to virtual nodes, and updating the model with retain supervision, replay, entropy maximization, and cloak regularization. Structural edits are used during optimization, while the main accuracy and membership-inference results are evaluated on the original graph. Experiments on four datasets report faster updates than full retraining, similar accuracy on Cora and Coauthor-CS, and reduced separability under the chosen posterior membership attack.
Critical strengths
1.Remapping forgotten nodes to existing virtual padding positions directly blocks their participation in intra-patch attention during optimization, with a simple design that avoids maintaining a separate model for each partition. 2.In Table 4, PLU-GT trails retraining by only 0.68 and 0.04 percentage points on Cora and Coauthor-CS while reducing runtime from 16.4 and 24.7 seconds to 2.1 and 3.3 seconds, showing a useful efficiency gain on these datasets.
Critical weaknesses
1.Forgetting is assessed mainly through a fixed posterior membership attack, but entropy and cloak directly reshape those posteriors, so near-chance AUC does not distinguish removal of training influence from failure of this particular attacker. 2.Appendix D replaces GraphEraser's separate shard models with local fine-tuning of a shared model and retains only FairGU's FIM-damping stage, removing important components without establishing the strength of the resulting baselines.
Questions for authors
1.Does the near-chance membership result persist when the attacker is retrained for the unlearned model, and how closely do PLU-GT's predictions on forgotten nodes match those of retraining? 2.Under the same initialization, epochs, and loss settings, how do affected-patch and full-retain-set supervision compare in accuracy and runtime, and what fraction of patches is actually affected? 3.With the full loss unchanged, how do accuracy and membership-inference results change when virtual-node remapping is disabled, evaluated separately on the original and edited graphs? 4.Table A.5 describes GraphEraser much like the CE-only ablation, yet their Cora accuracies are 62.86% and 58.02%, so which optimizer or implementation settings account for this difference?
Dear Reviewers,
The authors have now responded to the questions and concerns raised by everyone. Could I kindly ask you to review the authors' responses, take a look at the comments from the other reviewers, and actively participate in the discussion?
Thank you all very much for your valuable time and contributions!
Best regards,
The AC