Attention Smoothing Is All You Need For Unlearning

Saleh Zare Zade, Xiangyu Zhou, Sijia Liu, Dongxiao Zhu
3/1/2026
cs.LGcs.AIcs.CL

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

Large Language Models are prone to memorizing sensitive, copyrighted, or hazardous content, posing significant privacy and legal concerns. Retraining from scratch is computationally infeasible, whereas current unlearning methods exhibit unstable trade-offs between forgetting and utility, frequently producing incoherent outputs on forget prompts and failing to generalize due to the persistence of lexical-level and semantic-level associations in attention. We propose Attention Smoothing Unlearning (ASU), a principled framework that casts unlearning as self-distillation from a forget-teacher derived from the model's own attention. By increasing the softmax temperature, ASU flattens attention distributions and directly suppresses the lexical-level and semantic-level associations responsible for reconstructing memorized knowledge. This results in a bounded optimization objective that erases factual information yet maintains coherence in responses to forget prompts. Empirical evaluation on TOFU, MUSE, and WMDP, along with real-world and continual unlearning scenarios across question answering and text completion, demonstrates that ASU outperforms the baselines for most unlearning scenarios, delivering robust unlearning with minimal loss of model utility.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zade2026attention,
  title  = {Attention Smoothing Is All You Need For Unlearning},
  author = {Saleh Zare Zade and Xiangyu Zhou and Sijia Liu and Dongxiao Zhu},
  year   = {2026},
  eprint = {2603.01285},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.01285v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.01285.svg)](https://codeofpaper.com/paper/2603.01285)

Discussion