Pith. sign in

REVIEW 5 cited by

To Each (Textual Sequence) Its Own: Improving Memorized-Data Unlearning in Large Language Models

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 2405.03097 v1 pith:VO7EWMSK submitted 2024-05-06 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords unlearningtextualalgorithmsllmsmodelperspectiveprivacysequence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

LLMs have been found to memorize training textual sequences and regurgitate verbatim said sequences during text generation time. This fact is known to be the cause of privacy and related (e.g., copyright) problems. Unlearning in LLMs then takes the form of devising new algorithms that will properly deal with these side-effects of memorized data, while not hurting the model's utility. We offer a fresh perspective towards this goal, namely, that each textual sequence to be forgotten should be treated differently when being unlearned based on its degree of memorization within the LLM. We contribute a new metric for measuring unlearning quality, an adversarial attack showing that SOTA algorithms lacking this perspective fail for privacy, and two new unlearning methods based on Gradient Ascent and Task Arithmetic, respectively. A comprehensive performance evaluation across an extensive suite of NLP tasks then mapped the solution space, identifying the best solutions under different scales in model capacities and forget set sizes and quantified the gains of the new approaches.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Initialization is Half the Battle: Generating Diverse Images from a Guidance Potential Posterior

    cs.CV 2026-06 unverdicted novelty 7.0 of 10

    DivIn samples initial noise from a guidance potential posterior via Langevin dynamics to improve diversity in class-to-image and text-to-image generation.

  2. Is your algorithm unlearning or untraining?

    cs.LG 2026-04 conditional novelty 7.0 of 10

    Machine unlearning conflates reversing the influence of specific training examples (untraining) with removing the full underlying distribution or behavior (unlearning).

  3. From Anchors to Supervision: Memory-Graph Guided Corpus-Free Unlearning for Large Language Models

    cs.CL 2026-04 unverdicted novelty 6.0 of 10

    MAGE builds a memory graph from a user anchor to generate its own supervision signals for corpus-free unlearning, matching the effectiveness of methods that use external reference data on TOFU and RWKU benchmarks.

  4. LoReUn: Data Itself Implicitly Provides Cues to Improve Machine Unlearning

    cs.LG 2025-07 conditional novelty 6.0 of 10

    LoReUn, a plug-in loss-based reweighting strategy, improves approximate machine unlearning by focusing updates on hard-to-forget low-loss data points.

  5. Revisiting the Past: Data Unlearning with Model State History

    cs.LG 2025-06 unverdicted novelty 5.0 of 10

    MSA performs data unlearning in LLMs by arithmetic operations on prior model checkpoints to remove targeted datapoint influence, with experiments showing competitive or better results than existing unlearning methods.

Pith tools