Pith. sign in

REVIEW 3 cited by

Corrective Machine 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 2402.14015 v2 pith:SFNUX7IS submitted 2024-02-21 cs.LG cs.AIcs.CRcs.CV

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

Machine Learning models increasingly face data integrity challenges due to the use of large-scale training datasets drawn from the Internet. We study what model developers can do if they detect that some data was manipulated or incorrect. Such manipulated data can cause adverse effects including vulnerability to backdoored samples, systemic biases, and reduced accuracy on certain input domains. Realistically, all manipulated training samples cannot be identified, and only a small, representative subset of the affected data can be flagged. We formalize Corrective Machine Unlearning as the problem of mitigating the impact of data affected by unknown manipulations on a trained model, only having identified a subset of the corrupted data. We demonstrate that the problem of corrective unlearning has significantly different requirements from traditional privacy-oriented unlearning. We find most existing unlearning methods, including retraining-from-scratch without the deletion set, require most of the manipulated data to be identified for effective corrective unlearning. However, one approach, Selective Synaptic Dampening, achieves limited success, unlearning adverse effects with just a small portion of the manipulated samples in our setting, which shows encouraging signs for future progress. We hope our work spurs research towards developing better methods for corrective unlearning and offers practitioners a new strategy to handle data integrity challenges arising from web-scale training. Code is available at https://github.com/drimpossible/corrective-unlearning-bench.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. The Space Complexity of Learning-Unlearning Algorithms

    cs.LG 2025-06 accept novelty 8.0 of 10

    The space complexity of machine unlearning for realizability testing is characterized by eluder dimension (central lower bound), star number (ticketed upper bound), and hollow star number (bounded deletions), separati...

  2. Gradient Concentration, Not Weight Saliency, Explains Representation-Level Class Unlearning

    cs.LG 2026-07 accept novelty 7.0 of 10

    In class unlearning on CIFAR-10/100 with ResNet-18, the identity of saliency-selected weights does not affect representation-level recovery; late-layer gradient concentration and representation geometry drive the outcome.

  3. Superior resilience to poisoning and amenability to unlearning in quantum machine learning

    quant-ph 2025-08 conditional novelty 5.0 of 10

    A simulator study reports that QNNs hold accuracy under label flipping better than a large MLP and unlearn faster, but the claimed fundamental advantage is not established without regularized classical baselines.

Pith tools