Pith. sign in

REVIEW 5 cited by

Obliviate: Efficient Unmemorization for Protecting Intellectual Property 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 2502.15010 v2 pith:6OCIEMZ7 submitted 2025-02-20 cs.CL cs.AIcs.CRcs.LG

classification cs.CLcs.AIcs.CRcs.LG
keywords obliviatecopyrightmodelmodelsbenchmarkscopyrightedexactlanguage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent copyright agreements between AI companies and content creators underscore the need for fine-grained control over language models' ability to reproduce copyrighted text. Existing defenses-ranging from aggressive unlearning to simplistic output filters-either sacrifice model utility or inadequately address verbatim leakage. We introduce Obliviate, a lightweight post-training method that surgically suppresses exact reproduction of specified sequences while preserving semantic understanding. Obliviate first identifies memorized passages and then, for each target token, minimally adjusts the model's output distribution via a Kullback-Leibler divergence penalty to drive down the probability of exact reproduction. Simultaneously, we enforce a consistency loss on non-target tokens to retain the model's fluency and task performance. We evaluate Obliviate on four popular 6-8B-parameter models (LLaMA-3.1, LLaMA-3.1-Instruct, Qwen-2.5, and Yi-1.5) using synthetic memorization benchmarks and organic copyrighted excerpts (e.g., Moby Dick, Frankenstein, Alice in Wonderland and Les Miserables). Across all settings, Obliviate reduces verbatim recall by two orders of magnitude (e.g., from hundreds of words to fewer than 12) while degrading downstream accuracy by at most 1% on HellaSwag, MMLU, TruthfulQA, and Winogrande. Furthermore, we benchmark Obliviate aganist different unlearning and copyright techniques using the MUSE and CoTaEval benchmarks. These results position Obliviate as a practical, high-fidelity solution for copyright compliance in deployed LLMs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model

    cs.CL 2026-02 conditional novelty 6.0 of 10

    Anchored Decoding provably bounds the K-NAF divergence of any risky LM from a safe LM using per-step KL budgets, and a byte-level variant removes the shared-tokenizer requirement.

  2. Model Unlearning via Sparse Autoencoder Subspace Guided Projections

    cs.CL 2025-05 conditional novelty 6.0 of 10

    SSPU uses SAE-derived subspaces to guide weight updates, lowering WMDP-Cyber accuracy by 3.22% more than RMU while largely preserving MMLU, TruthfulQA, and GSM8K performance.

  3. R-TOFU: Unlearning in Large Reasoning Models

    cs.CL 2025-05 conditional novelty 6.0 of 10

    R-TOFU shows that answer-level unlearning is insufficient for large reasoning models because residual knowledge persists in chain-of-thought traces.

  4. A Lightweight Method to Disrupt Memorized Sequences in LLM

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A decoding-time intervention that substitutes a small model's probabilities for common function words into a large model's output reduces exact training-data recall by up to 10x with minimal measured quality loss.

  5. SoK: Machine Unlearning for Large Language Models

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A new taxonomy for LLM unlearning distinguishes removal-intended from suppression-intended methods, and argues that gradient ascent methods functionally behave like suppression.

Pith tools