- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies that LLM unlearning methods could cause damage to the semantically adjacent knowledge to the forget target. To define this, author use the blast radius. The paper has three contributions:
(1) BlastBench, a benchmark with 45 forget targets across three domains with about 13.8K QA pairs generated by an LLM. The authors also propose new metrics. A two-agent pipeline to construct the adjacent set where a prober agent that finds adjacent concepts based on an LLM-rated a score, and a synthesizer agent that generates retain QA pairs for these concepts without mentioning the forget target.
(2) An algorithm is exploited, AR-NPO, combining the NPO forget loss with a cross-entropy loss on the adjacent set and a KL loss on WikiText. The authors evaluate AR-NPO against GA, GD, NPO, and SimNPO on three 7B models, and claim that AR-NPO is the only method that achieves non-trivial forgetting while keeping adjacent knowledge above the original model.
Critical strengths
This paper considers an interesting problem in LLM unlearning. Collateral damage to neighboring knowledge is an important failure mode where the unlearning safety intervention might miss.
Critical weaknesses
This paper suffers from two following major concerns: (1) The proposed metrics, FE, ARR, DRR, FP, RR, are not well motivated and defined. Where is the motivation? Why the previous metrics like regular accuracy, verbmem, and knowmem on the forget and retain sets are not working here? In the definition, acc(·) is denoted as the mean per-token log-probability of the gold answer. Log-probabilities are negative. Also, the authors define ARR as acc(A)/acc_0(A). When the unlearned model gets worse on A, acc(A) becomes more negative and ARR rises above 1. Similar issue for FE = 1 − acc/acc_0 metric, where for strong forgetting mode, this metric becomes negative. On the other hand, the SimNPO method achieves 0.000 in every run, do we have any clipping operation here?
(2) I find the proposed method, AR-NPO, the same as NPO but with a new set added. In the original NPO paper (Zhang et al., 2024), various similar approaches are already included like retain-set cross-entropy (NPO+RT) and KL (NPO+KL). AR-NPO is the combination of both, with the adjacent set A as the retain set. So, there is no novelty in terms of the algorithm. The paper just considers/constructs a new training set. A fair comparison requires well-defined metrics and accounting for the trade-off in training time.
Questions for authors
Please check the Critical Weaknesses section.