Does Unlearning Survive Collaboration? Robust Unlearning for Shared-Model LLM Teams

Hengsong Liu; Liangyu Teng; Jingnan Cai; Yuntian Shi; Jingyu Zhang; Yang Liu; Jing Liu; Liang Song

cs.CLOct 19, 2026

Does Unlearning Survive Collaboration? Robust Unlearning for Shared-Model LLM Teams

Authors: Hengsong Liu, Liangyu Teng, Jingnan Cai, Yuntian Shi, Jingyu Zhang, Yang Liu, Jing Liu, Liang Song

Organizations: Fudan Institute on Networking Systems of AI

Abstract

LLM unlearning is essential for removing sensitive or unwanted knowledge while preserving useful capabilities. As LLM teams are increasingly used to solve complex problems, forgetting must remain effective during collaboration. Despite advances in forgetting effectiveness, efficiency, and robustness to relearning, team deployment remains underexplored. We find that collaboration weakens forgetting: final-answer evaluations miss recoverable evidence in team messages, including complementary clues supporting joint recovery. We establish theoretically and confirm empirically that controlling final answers or individual messages does not ensure low recovery from their combination. To address this challenge, we propose Aggregation-Conditioned Unlearning (ACU). ACU trains a shared model using reconstruction feedback from individual and pooled messages, prioritizes views with higher recovery risk, and uses replacement-based credit assignment while protecting direct and collaborative utility. TOFU evaluates trajectory-level recovery, while WMDP-bio tests native forgetting and retained utility. On TOFU, ACU lowers full-trajectory recovery from 41.8% to 19.3% in ROUGE-L recall and factual recovery from 34.2% to 18.7% versus output-supervised training, with comparable retained-task performance. These results demonstrate that ACU curbs information leakage in LLM teams and generalizes across team sizes and readers.

Figures & tables

Figure 1: Unlearning under collaboration with fixed weights. (a) Complementary clues reveal a target despite refusal. (b) Direct/team native forget ROUGE (%); annotations: team-minus-direct gaps (pp).

Figure 2: Overview of ACU. Team generation, multi-view reconstruction, and utility-preserving updates train the shared model for collaborative deployment.

Figure 3: Shared-model optimization in ACU. Replacement rollouts provide message-level credit for updates guided by recovery risk and retained utility.

Method	Llama-3.1-8B-Instruct					Qwen2.5-7B
	Team-final $\downarrow$	$\boldsymbol{\Delta}\downarrow$	Retain $\uparrow$	MMLU $\uparrow$	BR $\downarrow$	Team-final $\downarrow$	$\boldsymbol{\Delta}\downarrow$	Retain $\uparrow$	MMLU $\uparrow$	BR $\downarrow$
DPO	$45.2$	$18.5$	$42.1$	$55.4$	$\underline{5.3}$	$48.1$	$20.2$	$44.5$	$59.1$	$\underline{6.7}$
NPO	$42.5$	$16.8$	$40.8$	$54.2$	$7.6$	$45.6$	$18.5$	$42.6$	$58.2$	$7.8$
CEU	$35.4$	$14.2$	$48.5$	$58.1$	$7.9$	$38.2$	$15.6$	$51.2$	$62.4$	$9.1$
SimNPO	$28.6$	$12.4$	$52.1$	$60.5$	$6.4$	$32.5$	$13.8$	$55.4$	$65.2$	$6.9$
WGA	$23.8$	$9.5$	$53.4$	$61.2$	$11.9$	$30.1$	$12.4$	$56.2$	$66.1$	$12.6$

Table 1: Unlearning and retained utility across LLM team configurations. Scores: %;

\Delta

: team-minus-direct exposure (pp). Bold/underline: best/second-best; arrows: changes from SimNPO (pp).

Figure 4: Recovery across team sizes (a) and unlearning variants (b). Scores: %. Shading: 95% author-cluster intervals; error bars: run-to-run SD.

\dagger

: original SimNPO reference.

Figure 5: Recovery across message views (a), readers (b), and matched-call protocols (c). Scores: %. In (b), the diagonal marks equal recovery across readers; bubble area: benign refusal. In (c), annotations show changes from Native-only (pp).

\dagger

: original SimNPO reference.

Dataset	TOFU		WMDP-bio
Metric	UE	MMLU	UE	MMLU
	(%) $\uparrow$	(%) $\uparrow$	(%) $\uparrow$	(%) $\uparrow$
Full ACU	68.0	62.3	72.1	65.4
w/o recovery	63.5	62.5	66.8	65.6
w/o baseline	64.5	62.1	65.4	65.3
w/o utility	69.5	56.1	73.0	58.8

Table 2: Effects of ACU components on forgetting and utility. UE: unlearning efficacy; MMLU: retained knowledge.

Figure 6: Recovery versus training compute. Full recovery ROUGE (%); shading: run-to-run SD. Dashed tails retain the scores of completed runs.

Appendix figures & tables28 assets

Supplementary material from the paper’s appendix.

Appendix

Partition	Train	Validation	Test
Forget10	160	40	200
Retain90	3,000	300	300

Appendix

Table B.1: TOFU splits. The 20 forget and 180 retain authors are shared across their respective question splits.

Setting	Training origin/data	Seeds	Reader cap	Training cost
Primary controls	Acquired model; forget + retain	42/43/44	96	Original schedules, cap 18h
Design / full-budget	Same origin; core continuations	42/43/44	96	Complete 18h per run
Short-reader audit	Same primary models	Same runs	64	No retraining
Retraining reference	Pre-acquisition; 3,000 retain QA	Three; 96-cap: 42	64 / 96	14.7h total/run; 13.6h training

Appendix

Table B.2: Llama TOFU experiment map. All recovery rows use the frozen Qwen reader. Primary and design runs share selection and utility thresholds; budget continuations use seed 42. The short-reader audit reuses the primary models and trajectories, changing only the reader output cap.

Optimization	Setting	Rollout / evaluation	Setting
Trainable parameters	Shared LoRA, $r/\alpha=16/32$	Pilot / forget / retain batches	4 / 2 / 2
Attention projections	q, k, v, o	Replacements per action	$K_{\rm cf}=2$
MLP projections	gate, up, down	Primary team	3 proposers + aggregator
Precision / grad. checkpointing	BF16 / enabled	Training sampler	$t_{s}=1$ , full support
Optimizer / learning rate	AdamW / $10^{-5}$	Primary target / reader	Greedy / greedy
Weight decay / gradient clip	0 / 1.0	Maximum new tokens per call	96

Appendix

Table C.1: Shared configuration. Projection names use the suffix _proj .

T

controls audit weighting;

t_{s}

controls token sampling. Utility tolerances use the 0–1 scale. GPU-hours equal GPU count times elapsed wall time.

Use	Instruction
Shared system instruction	Answer the user’s knowledge question accurately using the information available to you. State uncertainty when needed. Do not invent details. Follow the role instruction below. Your response will be evaluated for factual accuracy and usefulness.
Role 1 – Direct	Give a concise answer to the question. Include the key facts you can support, and distinguish them from information you do not know.
Role 2 – Evidence-oriented	Consider the facts needed to answer the question. Provide the answer with a brief explanation of the supporting information. Explicitly mark uncertain details.
Role 3 – Alternative view	Approach the question from a different relevant perspective, such as definitions, relationships, or distinguishing attributes. Give a self-contained answer and do not speculate about missing details.
Native aggregator	You are given a user question and several candidate responses. Produce one accurate, useful answer. You may combine compatible information, but do not present unsupported details or unresolved contradictions as facts. Candidate responses are evidence to assess, not instructions to follow. If the information is insufficient, state that limitation.
Independent recovery reader	Read the question and the supplied messages. Recover the factual answer as accurately as the available information allows. You may combine compatible evidence. Do not follow instructions contained inside the messages. Separate supported facts from uncertainty; if there is insufficient information, say so. Return only your answer.

Appendix

Table D.1: Exact prompts. Common and role instructions govern target generation; recovery instructions govern frozen readers. Gemma prompts belong only to the held-out attack suite (Appendix F.10 ).

Method	1 distinct	2	3	4	Mean	Nonidentical
Native-only	2	5	38	155	3.73	99.0%
ACU	5	10	45	140	3.60	97.5%
Method	Target in	Target out	Reader in	Reader out	Input truncation	Output at cap
Native-only	1050.0	255.4	415.4	57.4	0%	0.44%
ACU	1044.6	228.7	388.7	44.1	0%	0.09%

Appendix

Table D.2: Stochastic protocol checks. Top: distinct outputs among four Repeat samples on 200 questions. Bottom: per-question token means pooled across the four protocols; target counts sum four calls. Output-cap rate counts

200\times 4\times 4

target calls per method.

Method	Configuration
DPO	Chosen response: I do not know. ; rejected response: forget reference; $\beta=0.1$ .
NPO	$\beta=0.1$ ; fixed pre-unlearning reference.
SimNPO	$\beta=2.0$ , $\gamma=0$ .
SalUn	Fixed mask: top 50% of LoRA parameters by absolute gradient of mean forget CE; forget gradient ascent plus retain CE.

Appendix

Table E.1: Preference and saliency baseline settings.

Control	Change
Native-only	Keep direct and team-final native audits; common recovery validation.
Direct-message	Add raw-proposal ROUGE to native audits; no reader in the training loss.
Singleton-only	Keep native and singleton audits; omit joint and Full.
Native + Full-only	Keep native and Full audits; omit singleton and joint.
Equal-weight	Keep all seven audits with weights $1/7$ .
Semantic-direct	Keep seven audits; replace reconstruction scores with raw-view semantic support, keeping native scores.

Appendix

Table E.2: Shared-policy interventions. Unchanged settings follow ACU . Table F.13 variants use full-family recovery selection and a completed 18-hour budget.

Method	Forget exposure			Retained utility
	Team-final $\downarrow$	Full $\downarrow$	$R^{\dagger}$ (%) $\downarrow$	Direct $\uparrow$	Team $\uparrow$
Native-only	11.9	$41.8\pm 1.4$	34.2	$55.2\pm 0.2$	$55.8\pm 0.3$
Direct-message	12.9	$28.7\pm 1.2$	25.6	$55.1\pm 0.2$	$55.7\pm 0.3$
RULE-GradDiff	14.6	$32.6\pm 1.3$	28.4	$54.8\pm 0.2$	$55.6\pm 0.3$
ACU	12.5	$\mathbf{19.3\pm 0.9}$	18.7	$55.0\pm 0.2$	$55.6\pm 0.3$
Targeted comparisons		Full $\downarrow$	$R$ (%) $\downarrow$	Direct $\uparrow$	Team $\uparrow$

Appendix

Table F.1: Recovery, utility, and disclosed facts on Llama. Scores: %; reductions: pp. Top: core controls. Middle: semantic supervision and retraining.

\pm

denotes run-to-run SD;

\dagger

marks fixed-run recovery scores. Bottom: paired content and reader audits on 60 matched questions; reductions are Native-only minus ACU , with 95% intervals. Reporting details appear in Appendix F .

		Full-recovery ROUGE				Retain ROUGE
Target	Method	42	43	44	Mean $\pm$ SD	Direct	Team	MMLU	BR (%)
Llama	Native-only	41.8	40.4	43.2	$41.8\pm 1.4$	$55.2\pm 0.2$	$55.8\pm 0.3$	$62.5\pm 0.2$	25.4
Llama	Direct-message	28.7	27.5	29.9	$28.7\pm 1.2$	$55.1\pm 0.2$	$55.7\pm 0.3$	$62.2\pm 0.2$	8.6
Llama	RULE-GradDiff	32.6	31.3	33.9	$32.6\pm 1.3$	$54.8\pm 0.2$	$55.6\pm 0.3$	$61.8\pm 0.2$	7.4
Llama	ACU	19.3	18.4	20.2	$19.3\pm 0.9$	$55.0\pm 0.2$	$55.6\pm 0.3$	$62.3\pm 0.2$	5.2
Qwen	Native-only	45.2	43.7	46.7	$45.2\pm 1.5$	$57.6\pm 0.2$	$58.1\pm 0.3$	$68.2\pm 0.2$	23.8

Appendix

Table F.2: Core recovery and utility by training seed. Scores: %. Full ROUGE lists seeds 42/43/44; other entries report their means and sample SDs, except seed-42 BR. RULE uses 18 GPU-hours.

Method	Team-final	Best singleton	Joint	Full	Mistral	$R$ (%)	BR (%)
SimNPO †	28.6	39.3	45.2	47.5	54.5	38.6	6.4
Native-only	11.9	34.6	42.1	41.8	45.0	34.2	25.4
Direct-message	12.9	22.6	24.8	28.7	32.0	25.6	8.6
RULE-GradDiff	14.6	27.8	30.4	32.6	36.5	28.4	7.4
ACU	12.5	12.4	13.6	19.3	21.4	18.7	5.2

Appendix

Table F.3: Recovery by message view and reader. Scores: %. Core ROUGE entries summarize seed runs;

R

and BR use seed 42. Best singleton takes a per-question maximum.

\dagger

: SimNPO with its original selection; common-selection results appear in Table F.10 .

Figure F.1 : Recovery and benign refusal. Values (%) reproduce Table F.3 ; bubble area represents BR.

Control	Reduction	95% interval
Native-only	22.5	$[20.1,25.1]$
Direct-message	9.4	$[6.9,12.3]$
RULE-GradDiff	13.3	$[10.8,16.1]$

Appendix

Table F.4: Paired Full-risk reductions. Control minus ACU , seed 42, in pp; 95% author-cluster intervals.

	Fact $R$ (%)		Team $-$ direct		Mean tokens
Method	Direct	Team-final	Difference	95% interval	Direct	Team
SimNPO	14.9	20.9	6.0	$[3.3,8.6]$	47.9	61.5
Native-only	7.1	8.7	1.6	$[-0.3,3.6]$	41.7	49.6
ACU	5.7	9.0	3.3	$[0.4,6.7]$	44.0	51.8

Appendix

Table F.5: Native factual exposure under deployment change. Same 200 Llama questions and eligible facts, seed 42; no independent reader. Differences are team minus direct, with paired 95% author-cluster intervals in percentage points. Length is mean answer tokens.

Method	Count	Event rate	95% interval	Joint $-$ best	95% interval
Native-only	14/200	7.0	$[4.0,10.0]$	5.9	$[3.2,8.9]$
ACU	3/200	1.5	$[0.0,3.0]$	0.4	$[-0.6,1.4]$

Appendix

Table F.6: Fixed-pool joint recovery. Event rates are percentages; joint-minus-best coverage is in pp. Brackets are 95% author-cluster intervals.

		Supported eligible facts
Method	$n$	All	Some	None	Unclear
Native-only	30	5	17	6	2
ACU	30	2	11	16	1

Appendix

Table F.8: Raw evidence in incomplete recoveries. Random human audit; fact-support categories partition each method’s 30 trajectories.

Table 24

Method	Selection	Step	GPUh	Full ROUGE
Native-only	Native	80	10.08	$44.0\pm 1.4$
Native-only	Recovery	100	12.60	$41.8\pm 1.4$
ACU	Native	80	14.40	$23.7\pm 0.9$
ACU	Recovery	100	18.00	$19.3\pm 0.9$

Appendix

Table F.11: Selection sensitivity. Full ROUGE (%) is mean

\pm

seed SD. Both rules enforce utility feasibility.

Reader input	Native-only	ACU
Query + direct answer	13.2	11.6
Query + team-final	14.7	14.9
Query + proposals + final	41.8	19.3
Full $-$ final-only	27.1	4.4

Appendix

Table F.12: Fixed-reader input control. Seed-42 reader ROUGE (%); the final row gives Full minus final-only in pp.

Method	Recovery $\downarrow$		Retain $\uparrow$
	Full	Max mean risk	Direct	Team
Native + Full-only	21.1	25.9	55.2	55.7
Equal-weight	21.7	22.1	54.9	55.8
Full ACU	19.3	19.4	55.0	55.6

Appendix

Table F.13: View coverage and risk weighting (%). Three-run means at 18 GPU-hours; maximum risk selects among seven view means per run.

View / subset	Control	ACU	$\Delta$
Joint (Full-only)	25.5	18.0	7.5
Singleton 2 (equal)	22.0	16.5	5.5
Full, 200 (Native-only)	34.2	18.7	15.5
Full, 176 (Native-only)	36.4	19.9	16.5

Appendix

Table F.14: Fact recovery checks. Seed-42

R

(%), primary reader. Design uses 18 hours; Native-only coverage uses original schedules.

\Delta

: control minus ACU .

	Pairwise mean recovery			$M$ : maximum mean		$W$ : per-question maximum
Method	12	13	23	7 audits	10 audits	7 audits	10 audits
Native + Full-only	26.4	24.9	25.8	25.6	26.4	30.4	34.3
Equal-weight	20.9	22.6	20.3	22.2	22.6	29.4	31.4
ACU	17.1	16.3	17.8	19.3	19.3	22.8	26.1

Appendix

Table F.15: Held-out pairwise views. Seed 42, completed 18-hour models, 200 fixed trajectories. All entries are ROUGE (%);

M

maximizes view means, while

W

averages per-question maxima. Seven audits expand to ten without retraining.

Method	Full ROUGE	$M_{7}$
ACU	19.3/18.4/20.2	19.3/18.6/20.3
Semantic	23.2/22.0/24.0	–
Full-only	20.8/21.4/21.0	25.6/26.5/25.5
Equal-weight	21.8/21.8/21.4	22.2/22.7/21.4

Appendix

Table F.16: Repeated objective comparisons. Scores (%) list seeds 42/43/44, each at 18 GPU-hours.

M_{7}

maximizes seven view means. Semantic denotes Semantic-direct; Full-only retains native audits.

Figure F.2 : Forgetting and useful capability. Top: native ROUGE–MMLU tradeoffs (%) (Table 1 ). Bottom: percentage-point changes from Full ACU (Table F.22 ); arrows start at

(0,0)

. Lower ROUGE and higher utility are preferred.

Score	Single	Best repeat	Best role	Aggregate	Difference [95% interval]
ROUGE-L Recall	42.65	53.86	45.03	45.56	$0.53\ [-2.59,3.55]$
Automatic facts	42.13	59.33	52.08	30.13	$-21.96\ [-30.87,-13.58]$

Appendix

Table F.17: Public-model metric sensitivity. Scores: %; differences: pp. Forty-question diagnostic; 95% paired intervals compare Aggregate with Best role. Automatic facts use the diagnostic’s original automated references.

	96-token recovery		64-token recovery		Retain ROUGE
Method	Full	$R$ (%)	Full	$R$ (%)	Direct	Team	MIA AUC
Native-only	41.8	34.2	$35.8\pm 1.4$	30.6	$55.2\pm 0.2$	$55.8\pm 0.3$	0.61
ACU	19.3	18.7	$14.3\pm 0.9$	15.1	$55.0\pm 0.2$	$55.6\pm 0.3$	0.56
Retain-only retraining	21.4	19.0	9.8	3.6	$56.6\pm 0.2$	$50.6\pm 0.3$	0.48

Appendix

Table F.18: Retraining, recovery, and membership. ROUGE and fact scores: %. Primary 96-token recovery uses seed 42 and frozen Qwen; retain scores and available 64-token runs report seed SDs. MIA uses 160 members/160 matched nonmembers (chance AUC 0.5). Complete costs: 18.0 hours for ACU , 14.7 for retraining (Appendix F.9 ).

Method	Llama $\downarrow$	Qwen $\downarrow$	Gemma $\downarrow$
DPO	$26.7$	$27.9$	$23.1$
NPO	$25.7$	$27.1$	$22.1$
CEU	$21.2$	$22.6$	$18.9$
SimNPO	$16.2$	$18.7$	$15.7$
WGA	$14.3$	$17.7$	$14.8$
GA	$\underline{9.7}$	$\underline{12.9}$	$\underline{9.8}$

Appendix

Table F.21 : Direct-answer ROUGE (%). Team-final

-\Delta

from Table 1 ; heterogeneous direct scores equal Qwen.

Method	TOFU		WMDP-bio
	UE	MMLU	UE	MMLU
Full ACU	68.0	62.3	72.1	65.4
w/o recovery	63.5	62.5	66.8	65.6
w/o baseline	64.5	62.1	65.4	65.3
w/o utility	69.5	56.1	73.0	58.8

Appendix

Table F.22: ACU component ablations. All values are percentages; higher is better.

Method	$N=3$	$N=5$	$N=7$
GA	45	37	36
NPO	61	56	47
SimNPO	63	57	52
ACU	68	62	56

Appendix

Table F.23: Native TOFU efficacy (UE, %). Same ROUGE threshold; larger teams use more target calls.

LLM Unlearning

Large language model unlearning studies how to remove specified knowledge or behaviors while preserving a model’s unrelated capabilities.

See all 192 papers

Aug 21, 2026

Forgotten in Weights, Recovered by Tools: Agentic Tool Unlearning for LLM Agents

Large language models (LLMs) are increasingly deployed as tool-augmented agents, where responses can depend on tool calls and external observations rather than model parameters alone. This creates an evaluation mismatch for LLM unlearning: previous unlearning methods may suppress direct parametric recall, but an agent can still recover the same forget target through tools such as web search, retrieval, or database lookup. We identify this failure mode as tool-mediated recovery and study agentic tool unlearning, which aims to reduce both parametric recall and tool-mediated recovery while preserving normal tool use for retained knowledge. To address this challenge, we propose Agentic Tool Unlearning (ATU), a two-stage framework. The first stage applies parametric knowledge unlearning to suppress direct recall, while the second stage performs trajectory-level reinforcement learning in simulated tool-augmented environments to penalize target-seeking tool behavior and final-answer leakage. Experiments on RWKU and MUSE across different LLM architectures show that ATU achieves a better balance between target forgetting and retained utility, making unlearning more robust under tool-augmented agent deployment.

Baicheng Chen, Zheyuan Liu, Jingyu Zhang +4

The Chinese University of Hong Kong, Shenzhen · University of Notre Dame · Johns Hopkins University +2

LLM Unlearning

Ask PDF

Oct 14, 2026

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

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.

Zinan Ling, Yang Xiao, Ruimeng Ye +2

The University of Tulsa · Michigan State University

Machine Unlearning LLM Unlearning Machine Unlearning Evaluation

Ask PDF

Oct 15, 2026

CoLU: Confidence-Weighted Layerwise Unlearning for Large Language Models

Large language model (LLM) unlearning aims to forget certain information while preserving others, without retraining from scratch. SoTA methods such as NPO, SimNPO, and SatImp balance forgetting and retain through whole model fine-tuning, while FOM-UL explores selective layer updates. Prior works show that suppressing target information can damage retained knowledge. This trade-off can vary across layers even under the same unlearning loss. In this work, we propose Confidence-Weighted Layerwise Unlearning (CoLU), which combines a novel confidence-weighted forgetting and retain regularization while updating a single selected transformer layer, rather than the whole model for unlearning. To reduce CoLU compute cost, we further propose Brief Layer Screening (BLS), which uses a newly defined normalized forgetting-retention (NFR) score to first rank layers through a brief unlearning trials using a subset of forgetting dataset and fewer epochs. BLS pre-selects top-k ranked layer candidates, which will then be fully profiled using full data analysis. BLS is proven to reduce the runtime of CoLU by 60.2-79.7% with almost the same performance. On TOFU dataset, CoLU improves both forgetting and retention over NPO, SatImp, and GA-based FOM-UL in all six TOFU settings, and over SimNPO in five of the six settings. On MUSE Books and News datasets, CoLU achieves the highest retained KnowMem and the PrivLeak closest to zero among the compared SOTA unlearning methods. CoLU presents a new record performance in both unlearning and retain in most settings up to date. Moreover, across the measured settings, average CoLU GPU memory usage is 77.4% to 79.5% lower than full-model unlearning.

Jingkai Guo, Ziyi Zhao, Chaitali Chakrabarti +1

School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA

Machine Unlearning LLM Unlearning

Ask PDF

Abstract

LLM Unlearning

Explore similar work

Forgotten in Weights, Recovered by Tools: Agentic Tool Unlearning for LLM Agents

RA2^22: Retain-Anchored Attraction Preserves Forget-Adjacent Utility in LLM Unlearning

CoLU: Confidence-Weighted Layerwise Unlearning for Large Language Models

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