RA$^2$: Retain-Anchored Attraction Preserves Forget-Adjacent Utility in LLM Unlearning

Zinan Ling, Yang Xiao, Ruimeng Ye, Sijia Liu, Bo Hui
10/14/2026
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Large Language Model (LLM) unlearning is often evaluated primarily by target suppression and clean retain utility. These metrics can miss a local failure mode: a model may perform well on standard retain prompts, yet degrade on benign reasoning when prompts lie near the forgotten domain. This phenomenon is termed forget-adjacent utility loss. A fundamental question is: where should forget representations go after they leave the removed behavior? Successful unlearning depends not only on whether forget-conditioned representations depart from the harmful computation, but also on the direction in which they are redirected afterward. We propose RA$^2$ (Retain-Anchored Attraction), a latent-space unlearning method that redirects forget-token states toward nearby retain-supported representations while preserving higher-layer behavior on retain data. On WMDP and MUSE, RA$^2$ yields higher forget-adjacent utility than strong unlearning baselines at similar broad-utility levels. These results show that the migration direction of forget representations materially affects benign behavior near the forget boundary. Our code is available at https://github.com/ZacLing/retain_anchored_attraction.

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. 1 weaker match is 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{ling2026ra,
  title  = {RA$^2$: Retain-Anchored Attraction Preserves Forget-Adjacent Utility in LLM Unlearning},
  author = {Zinan Ling and Yang Xiao and Ruimeng Ye and Sijia Liu and Bo Hui},
  year   = {2026},
  eprint = {2610.19385},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.19385v1}
}

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/2610.19385.svg)](https://codeofpaper.com/paper/2610.19385)

Discussion