Pith. sign in

REVIEW 4 cited by

Avoiding Copyright Infringement via Large Language Model Unlearning

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 2406.10952 v3 pith:X3KH6W5C submitted 2024-06-16 cs.CL

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

Pre-trained Large Language Models (LLMs) have demonstrated remarkable capabilities but also pose risks by learning and generating copyrighted material, leading to significant legal and ethical concerns. In real-world scenarios, model owners need to continuously address copyright infringement as new requests for content removal emerge at different time points. This leads to the need for sequential unlearning, where copyrighted content is removed sequentially as new requests arise. Despite its practical relevance, sequential unlearning in the context of copyright infringement has not been rigorously explored in existing literature. To address this gap, we propose Stable Sequential Unlearning (SSU), a novel framework designed to unlearn copyrighted content from LLMs over multiple time steps. Our approach works by identifying and removing specific weight updates in the model's parameters that correspond to copyrighted content. We improve unlearning efficacy by introducing random labeling loss and ensuring the model retains its general-purpose knowledge by adjusting targeted parameters. Experimental results show that SSU achieves an effective trade-off between unlearning efficacy and general-purpose language abilities, outperforming existing baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. System-Aware Unlearning Algorithms: Use Lesser, Forget Faster

    cs.LG 2025-06 conditional novelty 7.0 of 10

    The paper introduces system-aware unlearning and gives the first exact unlearning algorithm for linear classification that stores a sublinear-size core set instead of the entire dataset.

  2. LU-500: A Logo Benchmark for Concept Unlearning

    cs.CV 2026-07 conditional novelty 6.0 of 10

    A new 500-company benchmark shows current concept-erasure methods cannot remove small logos from generated images without also changing unrelated content.

  3. Towards Benign Memory Forgetting for Selective Multimodal Large Language Model Unlearning

    cs.AI 2025-11 conditional novelty 6.0 of 10

    An MLLM unlearning method and benchmark that aim to erase targeted private facts while preserving image understanding.

  4. Invisible Watermarks, Visible Gains: Steering Machine Unlearning with Bi-Level Watermarking Design

    cs.CR 2025-08 conditional novelty 6.0 of 10

    Water4MU tunes an invisible watermark on data so that machine unlearning algorithms can remove requested images more effectively, beating prior methods on 'challenging forgets'.

Pith tools