Approximate Machine Unlearning through Manifold Representation Forgetting Guided by Self Mode Connectivity

• URL: http://arxiv.org/abs/2605.22871v1
• Date: Wed, 20 May 2026 01:28:42 GMT
• Title: Approximate Machine Unlearning through Manifold Representation Forgetting Guided by Self Mode Connectivity
• Abstract summary: Machine unlearning enforces the right to be forgotten.<n>ManiF-SMC tackles the manifold representation-based unlearning problem.<n>It achieves unlearning effectiveness comparable to state-of-the-art approximate methods.
• Score: 27.485504993716884
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Machine unlearning is a fundamental mechanism that enforces the right to be forgotten. Existing unlearning studies that rely on label manipulation or task-gradient reversal often deliver limited unlearning effectiveness. Moreover, they can undermine the original learning objective and typically do not guarantee equivalence to standard unlearning by retraining. In this paper, we propose \textbf{ManiF-SMC} (\textbf{Mani}fold \textbf{F}orgetting with \textbf{S}elf \textbf{M}ode \textbf{C}onnectivity), motivated by the observation that a model retrained on the remaining data tends to classify erased samples by their semantic similarity to the retained data. We begin with systematically recasting the approximate unlearning as pushing each erased sample away from its original learned manifold representation centroid toward its nearest semantic neighbors in the retained data. This reformulation aligns unlearning with retraining behavior and operates purely in representation space, reducing reliance on labels and task-specific gradients. To tackle the manifold representation-based unlearning problem, ManiF-SMC encapsulates the unlearning and representation preservation goals in a margin-based triplet loss. Because finding a suitable margin for unlearning is challenging, we propose a self-mode-connectivity module that rapidly reconstructs the local manifold to guide the adaptive margins generation for each unlearning case. Extensive experiments on four representative datasets show that ManiF-SMC achieves unlearning effectiveness comparable to state-of-the-art approximate methods while operating solely within the model's representation space.

Related papers

• On-the-go Forgetting without Explicit Unlearning via ERASE [2.6426981014417046]
  ERASE is a framework for on-the-go forgetting that suppresses the observable influence of private data without modifying model weights.<n>We rigorously characterize sufficient conditions when ERASE provably achieves functional forgetting of designated subclasses.<n> ERASE maintains the best observed balance between forgetting efficacy, computational efficiency, and retention fidelity over recent unlearning-based methods.
  arXiv  Detail & Related papers  (2026-09-05T08:09:27Z)
• Not Every Subject Should Stay: Machine Unlearning for Noisy Engagement Recognition [53.005382593686356]
  Engagement recognition datasets are typically subject-indexed and often contain noisy, subjective supervision.<n>We study this setting through subject-level machine unlearning as a post-hoc sanitization mechanism for engagement recognition.
  arXiv  Detail & Related papers  (2026-05-06T10:03:06Z)
• An Illusion of Unlearning? Assessing Machine Unlearning Through Internal Representations [16.917151304941967]
  We show that state-of-the-art machine unlearning methods appear successful mainly due to a misalignment between last-layer features and the classifier.<n> hidden features remain highly discriminative, and simple linear probing can recover near-original accuracy.
  arXiv  Detail & Related papers  (2026-04-09T14:02:23Z)
• Erase at the Core: Representation Unlearning for Machine Unlearning [11.77697706755224]
  Erase at the Core (EC) is a framework designed to enforce forgetting throughout the entire network hierarchy.<n>EC integrates contrastive unlearning on the forget set with retain set preservation through deeply supervised learning.<n>EC is model-agnostic and can be incorporated as a plug-in module into existing unlearning methods.
  arXiv  Detail & Related papers  (2026-02-05T06:54:44Z)
• POUR: A Provably Optimal Method for Unlearning Representations via Neural Collapse [12.913395960667161]
  In computer vision, machine unlearning aims to remove the influence of specific visual concepts or training images without retraining from scratch.<n>We extend the notion of unlearning to the representation level, deriving a three-term interplay between forgetting efficacy, retention fidelity, and class separation.<n>Experiments on CIFAR-10/100 and PathMNIST demonstrate that POUR achieves effective unlearning while preserving retained knowledge, outperforming state-of-the-art unlearning methods on both classification-level and representation-level metrics.
  arXiv  Detail & Related papers  (2025-11-24T17:38:53Z)
• Reference-Specific Unlearning Metrics Can Hide the Truth: A Reality Check [60.77691669644931]
  We propose Functional Alignment for Distributional Equivalence (FADE), a novel metric that measures distributional similarity between unlearned and reference models.<n>We show that FADE captures functional alignment across the entire output distribution, providing a principled assessment of genuine unlearning.<n>These findings expose fundamental gaps in current evaluation practices and demonstrate that FADE provides a more robust foundation for developing and assessing truly effective unlearning methods.
  arXiv  Detail & Related papers  (2025-10-14T20:50:30Z)
• CoUn: Empowering Machine Unlearning via Contrastive Learning [12.677444111986707]
  CoUn is a novel MU framework inspired by the observation that a model retrained from scratch using only retain data classifies forget data based on semantic similarity to the retain data.<n>CoUn emulates this behavior by adjusting learned data representations through contrastive learning (CL) and supervised learning, applied exclusively to retain data.
  arXiv  Detail & Related papers  (2025-09-19T20:12:49Z)
• Rethinking Classifier Re-Training in Long-Tailed Recognition: A Simple Logits Retargeting Approach [102.0769560460338]
  We develop a simple logits approach (LORT) without the requirement of prior knowledge of the number of samples per class. Our method achieves state-of-the-art performance on various imbalanced datasets, including CIFAR100-LT, ImageNet-LT, and iNaturalist 2018.
  arXiv  Detail & Related papers  (2024-03-01T03:27:08Z)
• An Information Theoretic Approach to Machine Unlearning [43.423418819707784]
  To comply with AI and data regulations, the need to forget private or copyrighted information from trained machine learning models is increasingly important.<n>In this work, we address the zero-shot unlearning scenario, whereby an unlearning algorithm must be able to remove data given only a trained model and the data to be forgotten.<n>We derive a simple but principled zero-shot unlearning method based on the geometry of the model.
  arXiv  Detail & Related papers  (2024-02-02T13:33:30Z)
• Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
  Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice. We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
  arXiv  Detail & Related papers  (2023-12-27T09:03:43Z)
• Automatic Recall Machines: Internal Replay, Continual Learning and the Brain [104.38824285741248]
  Replay in neural networks involves training on sequential data with memorized samples, which counteracts forgetting of previous behavior caused by non-stationarity. We present a method where these auxiliary samples are generated on the fly, given only the model that is being trained for the assessed objective. Instead the implicit memory of learned samples within the assessed model itself is exploited.
  arXiv  Detail & Related papers  (2020-06-22T15:07:06Z)
• MMCGAN: Generative Adversarial Network with Explicit Manifold Prior [78.58159882218378]
  We propose to employ explicit manifold learning as prior to alleviate mode collapse and stabilize training of GAN. Our experiments on both the toy data and real datasets show the effectiveness of MMCGAN in alleviating mode collapse, stabilizing training, and improving the quality of generated samples.
  arXiv  Detail & Related papers  (2020-06-18T07:38:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.