- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes AGTTU, an attention-guided target token unlearning framework for LLMs. The method leverages the model's internal attention scores to distinguish critical "target tokens" from "non-target tokens" within the forget set. It then introduces a Contrastive Logits Preference Loss (CLPL) to precisely suppress target tokens while penalizing the degradation of non-target tokens. Combined with a retention constraint, AGTTU achieves effective unlearning without compromising the model's general utility, outperforming baseline methods.
Critical strengths
1.Intuitive and Efficient Motivation: The idea of leveraging the model's inherent attention patterns to identify unlearning targets is both intuitive and computationally efficient. It avoids the need for auxiliary identifiers or external scoring models.
2.Fine-Grained Unlearning Strategy: By distinguishing between "target tokens" (to be forgotten) and "non-target tokens" (to be retained) within the forget set, the method enables more precise unlearning compared to coarse-grained approaches, effectively mitigating over-forgetting.
3.Well-Designed Loss Function: The proposed Contrastive Logits Preference Loss (CLPL) thoughtfully introduces a margin and a one-sided penalty to balance target suppression and non-target retention.
Critical weaknesses
1.Limited Generalizability: The evaluation is restricted to two extremely small-scale models (Llama-3.2-1B and 3B). The lack of experiments on mainstream larger models (e.g., 7B, 13B) raises serious concerns about the method's scalability and generalizability, as unlearning difficulty typically increases with model size.
2.Limited Technical Novelty: The method largely combines existing components. The attention-based target token selection closely resembles prior work like DTO, and the proposed CLPL loss is mathematically almost identical to TPO's LPL, as the authors themselves acknowledge. Overall, the contribution appears more compositional than a substantive methodological advance.
3.Insufficient Mechanism Analysis: The paper lacks a rigorous justification for equating "high attention" with "high unlearning value." High attention scores may simply correspond to syntactic connectors rather than core knowledge. A qualitative analysis of the selected tokens is needed to validate the fundamental assumption of the method.
Questions for authors
1.Could the authors provide a more detailed justification for the choice of model scale? Given that unlearning complexity often increases with model size, do the authors have any preliminary evidence or theoretical arguments suggesting AGTTU can maintain its performance on 7B or larger models? 2.To better understand the novelty, could the authors explicitly articulate the key technical barriers that were overcome when integrating attention-based selection with the CLPL loss? What specific failure modes of simply applying DTO or TPO independently does the joint framework resolve?
5 comments
W2 Q2: The method largely combines existing components, so its substantive novelty requires clarifying the technical barriers overcome by jointly designing attention-based selection and CLPL, and the specific failure modes of standalone DTO or TPO that this framework resolves.
A2: We thank the reviewer for this question. Integrating attention-based selection with CLPL addresses two specific technical challenges.
1. Substantially reducing token-selection time. Among the selectors we compare, attention is the only one that obtains a per-token influence signal with O(1) forward passes. A single prefill pass yields the column sums of the final-layer attention matrix: the sum of column i aggregates the attention paid to token i by all subsequent answer positions, serving as an estimate of its importance to generating the remaining answer. In contrast, loss-based selection and DTO require O(L) token-wise computations, where L is the answer length—approximately 37 forward passes per example on TOFU and 2,048 per chunk on MUSE. NER and TPO require external or auxiliary models, and TPO’s local identifier also requires masking each answer token individually. Thus, attention is the only selector in our comparison that is both self-contained and requires O(1) forward passes. We have added timing comparisons of local token selectors to Appendix E.4, using Llama-3.2-1B on TOFU forget10, as shown below.
| Selector | Selection Time (s) ↓ | Uses an Auxiliary Model |
|---|---|---|
| NER (spaCy) | 24.4 | Yes |
| Loss-based | 184.1 | No |
| Gradient saliency | 19.6 | No |
| TPO (DistilBERT) | 104.5 | Yes |
| DTO (delta) | 34.8 | No |
| Attention (ours) | 8.8 | No |
2. CLPL unifies target suppression and non-target protection into a single reference-based objective. The reference model is the original model before unlearning, . TPO’s LPL also protects non-target tokens in the forget set, but does not constrain them relative to reference values. CLPL expresses both terms using the logit difference from , , and applies different constraints to each: the target term introduces a margin , requiring each target logit to decrease by at least m relative to its reference value; the non-target term is one-sided, increasing a logit only when it falls below its reference value. In other words, CLPL measures each token’s logit deviation from the reference model but acts in opposite directions: target tokens are suppressed, while non-target tokens are pulled back up only when their logits fall below the reference values.
Thus, applying DTO or TPO alone leaves several issues that our joint framework addresses: (i) local token selection in DTO and TPO requires O(L) token-wise forward passes, with computational cost increasing with answer length; (ii) TPO’s external-model variant introduces potential privacy risks; and (iii) LPL does not constrain non-target logits relative to reference values. In contrast, CLPL unifies target suppression and non-target protection through each token’s logit difference from the reference model θ₀. The target term introduces a margin to enforce a larger decrease, while the non-target term applies a one-sided penalty only when the logit falls below its reference value, balancing effective forgetting with the preservation of general capabilities.
W3: A qualitative analysis of selected tokens is needed to establish whether high attention identifies core knowledge rather than syntactic connectors, supporting its use as a proxy for unlearning value.
We thank the reviewer for raising this point. Our rationale rests on a principled connection: work on KV-cache optimization has demonstrated that attention scores can identify tokens important for generation. H2O and SnapKV retain these tokens' key–value pairs while discarding others, preserving generation quality under cache compression. Unlearning, in turn, seeks to disrupt the generation of specific answers. The same importance signal thus informs which tokens to retain during inference and which to suppress during unlearning, suggesting a duality between the two objectives. We empirically tested this reverse application: masking attention-selected tokens reduces the generation probability of the full answer more than random masking, supporting the signal’s relevance to unlearning.
To address the concern that high attention may merely identify syntactic connectors, we analyzed the part-of-speech distribution of selected tokens. Content words (e.g., nouns and verbs) account for 68.4% of attention-selected tokens, compared with 59.7% across all answer tokens, while function words (e.g., prepositions and conjunctions) account for 27.1%, compared with 29.9% overall. Content words therefore dominate the selection, which is inconsistent with the hypothesis that attention merely selects syntactic connectors.
W1 Q1:Evaluation is limited to Llama-3.2-1B and 3B, leaving the method’s scalability and generalizability to larger models, such as 7B and 13B, unverified.A more detailed justification of the chosen model sizes and preliminary empirical evidence or theoretical arguments are needed to support AGTTU’s performance on models with 7B parameters or more.
A1: We thank the reviewer for the follow-up question about model scale. We selected Llama-3.2-1B and Llama-3.2-3B to align with prior work: TPO evaluates Llama-3.2-3B and Llama-2-7B, while DTO evaluates Llama-3.2-1B and Llama-2-7B. Due to computational constraints, our initial 7B evaluation focused on MUSE-Books. We have now added experiments with Llama-2-7B on TOFU forget01/05/10 to the main experimental section. AGTTU’s results on Llama-2-7B are shown below: Table 3: Results on TOFU with Llama-2-7B.
AGTTU achieves substantially higher forgetting quality on both the 5% and 10% splits. These results address the concern that unlearning becomes more difficult as model size increases, showing no degradation in AGTTU’s effectiveness at the 7B scale. Together with the 7B results on MUSE-Books presented in the initial submission, these findings support AGTTU's effectiveness at this model scale.