Pith. sign in

REVIEW 2 cited by

GRU: Mitigating the Trade-off between Unlearning and Retention for LLMs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.09117 v3 pith:IJTYE64W submitted 2025-03-12 cs.LG cs.CL

classification cs.LGcs.CL
keywords unlearningtrade-offgeneralgradientresponsesretentionacrossapplications
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Large language model (LLM) unlearning has demonstrated its essential role in removing privacy and copyright-related responses, crucial for their legal and safe applications. However, the pursuit of complete unlearning often comes with substantial costs due to its compromises in their general functionality, leading to a notorious trade-off between unlearning and retention. It motivates this paper to explore enhanced unlearning schemes that can mitigate this trade-off. Specifically, we propose Gradient Rectified Unlearning (GRU), an improved framework that regulates the directions of gradient updates during the unlearning procedure such that their side impacts on other, unrelated responses can be minimized. GRU is easy and general to implement, demonstrating practical effectiveness across a variety of well-established unlearning benchmarks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. HermesHFL: Incentive-Compatible Hierarchical Federated Unlearning for Dynamic LLM Fine-Tuning

    cs.CE 2026-07 reject novelty 6.0 of 10

    HermesHFL plus Neogen jointly optimize incentives, client–edge association, and gradient-ascent unlearning so hierarchical LoRA fine-tuning remains useful after clients leave and rejoin.

  2. A mean teacher algorithm for unlearning of language models

    cs.LG 2025-04 conditional novelty 6.0 of 10

    A mean teacher optimizer that approximates slow natural gradient descent, paired with a new negative log-unlikelihood loss, reduces memorization and privacy leakage on MUSE-News and MUSE-Books, with the strongest vari...

Pith tools