CoUn: Empowering Machine Unlearning via Contrastive Learning

• URL: http://arxiv.org/abs/2509.16391v2
• Date: Fri, 17 Oct 2025 13:39:03 GMT
• Title: CoUn: Empowering Machine Unlearning via Contrastive Learning
• Authors: Yasser H. Khalil, Mehdi Setayesh, Hongliang Li,
• Abstract summary: 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.
• Score: 12.677444111986707
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Machine unlearning (MU) aims to remove the influence of specific "forget" data from a trained model while preserving its knowledge of the remaining "retain" data. Existing MU methods based on label manipulation or model weight perturbations often achieve limited unlearning effectiveness. To address this, we introduce CoUn, a novel MU framework inspired by the observation that a model retrained from scratch using only retain data classifies forget data based on their semantic similarity to the retain data. CoUn emulates this behavior by adjusting learned data representations through contrastive learning (CL) and supervised learning, applied exclusively to retain data. Specifically, CoUn (1) leverages semantic similarity between data samples to indirectly adjust forget representations using CL, and (2) maintains retain representations within their respective clusters through supervised learning. Extensive experiments across various datasets and model architectures show that CoUn consistently outperforms state-of-the-art MU baselines in unlearning effectiveness. Additionally, integrating our CL module into existing baselines empowers their unlearning effectiveness.

Related papers

• MeGU: Machine-Guided Unlearning with Target Feature Disentanglement [73.49657372882082]
  We propose a novel framework that guides unlearning through concept-aware re-alignment.<n>MeGU enables controlled and selective forgetting, effectively mitigating both under-unlearning and over-unlearning.
  arXiv  Detail & Related papers  (2026-02-19T05:20:31Z)
• Forgetting-MarI: LLM Unlearning via Marginal Information Regularization [6.979586479353831]
  Existing unlearning methods often degrade model performance by removing more information than necessary when attempting to ''forget'' specific data.<n>We introduce Forgetting-MarI, an LLM unlearning framework that provably removes only the additional (marginal) information contributed by the data to be unlearned.<n>By penalizing marginal information, our method yields an explicit upper bound on the unlearn dataset's residual influence in the trained models, providing provable undetectability.
  arXiv  Detail & Related papers  (2025-11-14T22:48:39Z)
• IMU: Influence-guided Machine Unlearning [12.87795856802456]
  Machine unlearning (MU) enables models to selectively forget specific data points upon request.<n>Most existing MU algorithms require partial or full fine-tuning on the retain set.<n>We propose Influence-guided Machine Unlearning (IMU), a simple yet effective method that conducts MU using only the forget set.
  arXiv  Detail & Related papers  (2025-08-03T07:00:28Z)
• Efficient Machine Unlearning via Influence Approximation [75.31015485113993]
  Influence-based unlearning has emerged as a prominent approach to estimate the impact of individual training samples on model parameters without retraining.<n>This paper establishes a theoretical link between memorizing (incremental learning) and forgetting (unlearning)<n>We introduce the Influence Approximation Unlearning algorithm for efficient machine unlearning from the incremental perspective.
  arXiv  Detail & Related papers  (2025-07-31T05:34:27Z)
• Instance-Level Data-Use Auditing of Visual ML Models [49.862257986549885]
  Growing trend of legal disputes over the unauthorized use of data in machine learning (ML) systems highlights the need for reliable data-use auditing mechanisms.<n>We present the first proactive, instance-level, data-use auditing method designed to enable data owners to audit the use of their individual data instances in ML models.
  arXiv  Detail & Related papers  (2025-03-28T13:28:57Z)
• CLIPErase: Efficient Unlearning of Visual-Textual Associations in CLIP [57.49519639951552]
  We introduce CLIPErase, a novel approach that disentangles and selectively forgets both visual and textual associations.<n>Experiments on the CIFAR-100 and Flickr30K datasets demonstrate that CLIPErase effectively forgets designated associations in zero-shot tasks for multimodal samples.
  arXiv  Detail & Related papers  (2024-10-30T17:51:31Z)
• Unlearn What You Want to Forget: Efficient Unlearning for LLMs [92.51670143929056]
  Large language models (LLMs) have achieved significant progress from pre-training on and memorizing a wide range of textual data. This process might suffer from privacy issues and violations of data protection regulations. We propose an efficient unlearning framework that could efficiently update LLMs without having to retrain the whole model after data removals.
  arXiv  Detail & Related papers  (2023-10-31T03:35:59Z)
• Supervised Stochastic Neighbor Embedding Using Contrastive Learning [4.560284382063488]
  Clusters of samples belonging to the same class are pulled together in low-dimensional embedding space. We extend the self-supervised contrastive approach to the fully-supervised setting, allowing us to effectively leverage label information.
  arXiv  Detail & Related papers  (2023-09-15T00:26:21Z)
• Cross-Model Cross-Stream Learning for Self-Supervised Human Action Recognition [19.86316311525552]
  This paper first applies a new contrastive learning method called BYOL to learn from skeleton data. Inspired by SkeletonBYOL, this paper further presents a Cross-Model and Cross-Stream framework.
  arXiv  Detail & Related papers  (2023-07-15T12:37:18Z)
• Self-Taught Metric Learning without Labels [47.832107446521626]
  We present a novel self-taught framework for unsupervised metric learning. It alternates between predicting class-equivalence relations between data through a moving average of an embedding model and learning the model with the predicted relations as pseudo labels.
  arXiv  Detail & Related papers  (2022-05-04T05:48:40Z)

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.