- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper studies how to effectively forget target knowledge in LLM Unlearning while keeping the model's original abilities as much as possible. The authors find that existing unlearning methods may cause some unnecessary changes to the model during forgetting. These changes can hurt the model's other abilities, and some of them can be recovered without greatly affecting the forgetting results. Based on this finding, the authors propose Propose-Then-Project Unlearning (PTP-U), a two-stage method. In the first stage, the method uses local analytical editing based on curvature information to forget the target knowledge. In the second stage, it uses KL-based Recovery with clear forgetting constraints to make the model's outputs on non-target data closer to those of the original model, helping recover its lost abilities. Experiments on multiple models and unlearning benchmarks show that PTP-U achieves a good Forget-Retain Trade-off. It can effectively forget target knowledge while better keeping the model's original abilities.
Critical strengths
- The paper provides an interesting idea. It uses a two-stage design that first forgets the target knowledge and then recovers the model's lost abilities. This helps keep the model's original abilities as much as possible while still achieving effective forgetting.
- The paper provides fairly complete experiments, covering different models and unlearning tasks. It also includes many ablation studies and detailed analyses, which support the main conclusions of the paper to some extent.
Critical weaknesses
-
The overall design of PTP-U is quite heavy. It involves curvature estimation, analytic editing, Sequential Relinearization, and repeated constraint checks, which add considerable computational and engineering complexity. Table 6 shows that Stage I accounts for most of the computational cost. If I understand correctly, the goal of Stage I is to forget the target knowledge while preserving as much of the Base model's original behavior as possible. Although the paper provides an interesting view of unlearning, it does not clearly show whether its computationally expensive Stage I is necessary compared with existing, potentially simpler unlearning methods (e.g., [1, 2]).
-
The Recovery mechanism in this paper is quite similar to the KL-based Retention Regularization commonly used in existing LLM unlearning methods. The current experiments mainly show the effectiveness of each component, but it remains unclear whether this two-stage optimization framework offers significant advantages over simpler end-to-end KL-regularized or constrained optimization methods.
[1] Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearning
[2] LLM Unlearning via Neural Activation Redirection
Questions for authors
- Can Stage I be replaced with a more lightweight unlearning method, or even a simpler and more direct method such as GA? How would the final Forget-Retain Trade-off change after applying the same Recovery stage?
- Compared with existing end-to-end optimization that combines Forget Loss and Retain KL, what specific advantages does PTP-U's two-stage design offer that cannot be achieved through simpler regularization methods?
- Stage II performs Recovery through KL alignment on a fixed Anchor Distribution and shows improvements on downstream tasks. How well does this Recovery generalize across different Anchor Distributions? Does it depend on a specific type of data? If the Anchor Data comes from different sources, can it still improve performance on downstream tasks?