OPC: One-Point-Contraction Unlearning Toward Deep Feature Forgetting
Jaeheun Jung, Bosung Jung, Suhyun Bae, Donghun Lee

TL;DR
This paper introduces OPC, a novel unlearning method that enforces deep feature forgetting through one-point-contraction, significantly improving robustness against performance recovery and data reconstruction attacks.
Contribution
The paper proposes a theoretical criterion for deep forgetting, an efficient approximation algorithm, and a new unlearning method called OPC that outperforms existing approaches in robustness.
Findings
OPC achieves effective unlearning on image classification benchmarks.
OPC demonstrates superior resistance to recovery and reconstruction attacks.
Deep feature forgetting enhances unlearning robustness.
Abstract
Machine unlearning seeks to remove the influence of particular data or class from trained models to meet privacy, legal, or ethical requirements. Existing unlearning methods tend to forget shallowly: phenomenon of an unlearned model pretend to forget by adjusting only the model response, while its internal representations retain information sufficiently to restore the forgotten data or behavior. We empirically confirm the widespread shallowness by reverting the forgetting effect of various unlearning methods via training-free performance recovery attack and gradient-inversion-based data reconstruction attack. To address this vulnerability fundamentally, we define a theoretical criterion of ``deep forgetting'' based on one-point-contraction of feature representations of data to forget. We also propose an efficient approximation algorithm, and use it to construct a novel general-purpose…
Peer Reviews
Decision·Submitted to ICLR 2026
1. The concept (deep feature forgetting and shallow forgetting) is important for MU.
1. A Fundamental and Disqualifying Methodological Flaw: There is a critical disconnect between the paper's stated goal and its actual implementation. The paper claims to achieve "deep feature forgetting" by contracting feature representations f_θ(x) to the origin. However, the proposed loss function (Eq. 1) minimizes the L2 norm of the logits m_θ(x), where m_θ = g_θ ◦ f_θ. Minimizing the logit norm does not guarantee that the feature norm is minimized. A model can easily achieve a small logit no
1. The proposed method builds on a clear geometric intuition: contract model behavior locally around the target sample. This is more interpretable than gradient-matching or complex optimization-based unlearning. 2. The method seems computationally light compared to retraining-based or iterative gradient alignment approaches, making it more practical for large-scale use. 3. The presentation of the paper is good, that it is well-written and easy to follow.
1. Lack of justification for design choices: the motivation for ``contraction'' as a forgetting mechanism is qualitatively presented, but lacks empirical argument why it is the most suitable one for unlearning. Providing such results would help understand this mechanism. 2. About ablation study/sensitivity analysis: the choice of contraction strength, feature space vs parameter space contraction, and number of steps are not sufficiently justified. 3. About the experiments: the paper seems lack
- The paper is easy to follow, and the motivation is clear. - The proposed method is simple yet effective. - Extensive experiments are conducted.
- The main concern is about the claim that forgetting data should be treated as unseen (OOD) samples. As for OOD, low norms could be due to the samples lying outside the training distribution, while for unlearning, forgetting data belongs to the training distribution and could be highly entangled with retain data, especially for sample-wise unlearning settings. - The theoretical part is also based on the output (logits); it cannot provide the guarantee that latent representations no longer conta
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReservoir Engineering and Simulation Methods · Advanced Neural Network Applications · Medical Image Segmentation Techniques
