mlsanityData to 14 Oct 2026

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

arXiv 2507.07754 ↗First posted 10 Jul 2025cs.LG cs.AIcited by 2

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 42 of its 49 references that are in the map. First posted on arXiv 10 Jul 2025.

Builds on

42 of 49 references.

Closest ancestors · 25

Same direction, newest first

  1. 2025Unlearning's Blind Spots: Over-Unlearning and Prototypical Relearning Attack2 Jun
  2. 2025Unlearning Isn't Deletion: Investigating Reversibility of Machine Unlearning in LLMs22 May
  3. 2025Decoupled Distillation to Erase: A General Unlearning Method for Any Class-centric Tasks31 Mar
  4. 2025Are We Truly Forgetting? A Critical Re-examination of Machine Unlearning Evaluation Protocols10 Mar
  5. 2024MUNBa: Machine Unlearning via Nash Bargaining23 Nov
  6. 2024Do Unlearning Methods Remove Information from Language Model Weights?11 Oct
  7. 2024Unlearning or Obfuscating? Jogging the Memory of Unlearned LLMs via Benign Relearning19 Jun
  8. 2024What makes unlearning hard and what to do about it3 Jun
  9. 2024Reconstruction Attacks on Machine Unlearning: Simple Models are Vulnerable30 May
  10. 2024Learn What You Want to Unlearn: Unlearning Inversion Attacks against Machine Unlearning4 Apr
  11. 2024Inexact Unlearning Needs More Careful Evaluations to Avoid a False Sense of Privacy2 Mar
  12. 2024Loss-Free Machine Unlearning29 Feb
13 more
  1. 2024Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning18 Jan
  2. 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation19 Oct
  3. 2023Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening15 Aug
  4. 2023Model Sparsity Can Simplify Machine Unlearning11 Apr
  5. 2023Boundary Unlearning21 Mar
  6. 2022Forget Unlearning: Towards True Data-Deletion in Machine Learning17 Oct
  7. 2022A Survey of Machine Unlearning6 Sep
  8. 2022Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teacher17 May
  9. 2022Towards Adversarial Evaluations for Inexact Machine Unlearning17 Jan
  10. 2021Fast Yet Effective Machine Unlearning17 Nov
  11. 2021Unrolling SGD: Understanding Factors Influencing Machine Unlearning27 Sep
  12. 2021Machine Unlearning of Features and Labels26 Aug
  13. 2021Remember What You Want to Forget: Algorithms for Machine Unlearning4 Mar

Other references · 17

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  3. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  4. 2019Similarity of Neural Network Representations Revisitedcited by 1,755
  5. 2019Machine Unlearningcited by 1,061
  6. 2021Membership Inference Attacks From First Principlescited by 878
  7. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
  8. 2019Certified Data Removal from Machine Learning Modelscited by 535
  9. 2018Poison Frogs! Targeted Clean-Label Poisoning Attacks on Neural Networkscited by 519
  10. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
  11. 2020CSI: Novelty Detection via Contrastive Learning on Distributionally Shifted Instancescited by 441
  12. 2021On the Importance of Gradients for Detecting Distributional Shifts in the Wildcited by 339
5 more
  1. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 311
  2. 2018Reducing Network Agnostophobiacited by 165
  3. 2023Foundation Models and Fair Usecited by 116
  4. 2023Understanding the Feature Norm for Out-of-Distribution Detectioncited by 27
  5. 2024Potion: Towards Poison Unlearningcited by 14

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025POUR: A Provably Optimal Method for Unlearning Representations via Neural Collapse
  2. 2026Class Unlearning via Depth-Aware Removal of Forget-Specific Directions
  3. 2026Source-Free Class Relearning: Diagnosing Forgetting in Class Unlearning
  4. 2026PURGE: Projected Unlearning via Retain-Guided Erasure
  5. 2026Models Designed to Forget: Machine Unlearning via Key Deletion
  6. 2025Redirection for Erasing Memory (REM): Towards a universal unlearning method for corrupted data
  7. 2026Erased, but Not Gone: Output Forgetting Is Not True Forgetting
  8. 2025Train Once, Forget Precisely: Anchored Optimization for Efficient Post-Hoc Unlearning