Pith. sign in

REVIEW 2 cited by

One-Point Contraction: Erasing Representational Separability toward Irreversible Deep Forgetting

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 2507.07754 v3 pith:NP4NGLR5 submitted 2025-07-10 cs.LG cs.AI

classification cs.LGcs.AI
keywords unlearningfeaturesaccuracycontractionforget-setcollapsesfm-recoveryforgetting
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Machine unlearning is usually evaluated by what the classifier outputs: forget-set accuracy, confidence, membership-inference scores. We show that this is not enough. Across 14 representative unlearning methods on CIFAR-10 and SVHN, a single linear map fitted on a held-out calibration set, with no access to the forgotten data, reverses the unlearning in seconds and recovers forget-set accuracy to within a few percent of the original model. Recovered features even support pixel-level reconstruction through a generic decoder. We call this diagnostic Feature Mapping Recovery (FM-recovery). The pattern it exposes is uniform: current unlearning methods do not erase information from the representation, they apply an invertible linear distortion that hides it from one particular prediction head. We propose One-Point Contraction (OPC), an unlearning objective that collapses forget-set features to the origin while leaving the retain-set geometry intact. We prove that this contraction is equivalent to driving the predictive distribution to maximum entropy, so the same mechanism delivers behavioral forgetting and representation-level erasure at once. Forgotten queries land in a region the network treats as out-of-distribution, and the gradient signal on those queries collapses along with their features. OPC is the only method in our benchmark that survives FM-recovery, resists relearning and gradient-inversion attacks, and decouples forget from retain features in entangled settings, all without sacrificing retain or test accuracy.

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. SCOPE: Entanglement Frontier Escape for Source-Free Class Unlearning

    cs.LG 2026-08 conditional novelty 7.0 of 10

    A tight lower bound for fixed-projection class unlearning is proven, and an input-conditional gate (SCOPE) escapes the bound while achieving state-of-the-art source-free deletion.

  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.

Pith tools