SecureCut: Federated Gradient Boosting Decision Trees with Efficient Machine Unlearning

• URL: http://arxiv.org/abs/2311.13174v1
• Date: Wed, 22 Nov 2023 05:38:53 GMT
• Title: SecureCut: Federated Gradient Boosting Decision Trees with Efficient Machine Unlearning
• Authors: Jian Zhang, Bowen Li Jie Li, Chentao Wu
• Abstract summary: It has become imperative to enable data removal in Vertical Federated Learning (VFL) where multiple parties provide private features for model training. In VFL, data removal, i.e., textitmachine unlearning, often requires removing specific features across all samples under privacy guarentee. We propose methname, a novel Gradient Boosting Decision Tree (GBDT) framework that effectively enables both textitinstance unlearning and textitfeature unlearning without the need for retraining from scratch.
• Score: 10.011146979811752
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In response to legislation mandating companies to honor the \textit{right to be forgotten} by erasing user data, it has become imperative to enable data removal in Vertical Federated Learning (VFL) where multiple parties provide private features for model training. In VFL, data removal, i.e., \textit{machine unlearning}, often requires removing specific features across all samples under privacy guarentee in federated learning. To address this challenge, we propose \methname, a novel Gradient Boosting Decision Tree (GBDT) framework that effectively enables both \textit{instance unlearning} and \textit{feature unlearning} without the need for retraining from scratch. Leveraging a robust GBDT structure, we enable effective data deletion while reducing degradation of model performance. Extensive experimental results on popular datasets demonstrate that our method achieves superior model utility and forgetfulness compared to \textit{state-of-the-art} methods. To our best knowledge, this is the first work that investigates machine unlearning in VFL scenarios.

Related papers

• NOVO: Unlearning-Compliant Vision Transformers [17.810044173023474]
  pname can perform unlearning for future unlearning requests without any fine-tuning over the requested set.<n>Forgetting is achieved by withdrawing keys, making unlearning on-the-fly and avoiding performance degradation.
  arXiv  Detail & Related papers  (2025-07-04T04:12:34Z)
• BLUR: A Bi-Level Optimization Approach for LLM Unlearning [105.98410883830596]
  We argue that it is important to model the hierarchical structure of the unlearning problem.<n>We propose a novel algorithm, termed Bi-Level UnleaRning (textttBLUR), which delivers superior performance.
  arXiv  Detail & Related papers  (2025-06-09T19:23:05Z)
• FUNU: Boosting Machine Unlearning Efficiency by Filtering Unnecessary Unlearning [9.472692023087223]
  We propose FUNU, a method to identify data points that lead to unnecessary unlearning. We provide a theoretical analysis of FUNU and conduct extensive experiments to validate its efficacy.
  arXiv  Detail & Related papers  (2025-01-28T01:19:07Z)
• Federated Unlearning with Gradient Descent and Conflict Mitigation [11.263010875673492]
  Federated Unlearning (FU) has been considered a promising way to remove data without full retraining. We propose Federated Unlearning with Orthogonal Steepest Descent (FedOSD)
  arXiv  Detail & Related papers  (2024-12-28T16:23:10Z)
• Vertical Federated Unlearning via Backdoor Certification [15.042986414487922]
  VFL offers a novel paradigm in machine learning, enabling distinct entities to train models cooperatively while maintaining data privacy. Recent privacy regulations emphasize an individual's emphright to be forgotten, which necessitates the ability for models to unlearn specific training data. We introduce an innovative modification to traditional VFL by employing a mechanism that inverts the typical learning trajectory with the objective of extracting specific data contributions.
  arXiv  Detail & Related papers  (2024-12-16T06:40:25Z)
• Accurate Forgetting for All-in-One Image Restoration Model [3.367455972998532]
  Currently, a low-cost scheme called Machine Unlearning forgets the private data remembered in the model. Inspired by this, we try to use this concept to bridge the gap between the fields of image restoration and security.
  arXiv  Detail & Related papers  (2024-09-01T10:14:16Z)
• The Frontier of Data Erasure: Machine Unlearning for Large Language Models [56.26002631481726]
  Large Language Models (LLMs) are foundational to AI advancements. LLMs pose risks by potentially memorizing and disseminating sensitive, biased, or copyrighted information. Machine unlearning emerges as a cutting-edge solution to mitigate these concerns.
  arXiv  Detail & Related papers  (2024-03-23T09:26:15Z)
• Communication Efficient and Provable Federated Unlearning [43.178460522012934]
  We study federated unlearning, a novel problem to eliminate the impact of specific clients or data points on the global model learned via federated learning (FL) This problem is driven by the right to be forgotten and the privacy challenges in FL. We introduce a new framework for exact federated unlearning that meets two essential criteria: textitcommunication efficiency and textitexact unlearning provability.
  arXiv  Detail & Related papers  (2024-01-19T20:35:02Z)
• Learn to Unlearn for Deep Neural Networks: Minimizing Unlearning Interference with Gradient Projection [56.292071534857946]
  Recent data-privacy laws have sparked interest in machine unlearning. Challenge is to discard information about the forget'' data without altering knowledge about remaining dataset. We adopt a projected-gradient based learning method, named as Projected-Gradient Unlearning (PGU) We provide empirically evidence to demonstrate that our unlearning method can produce models that behave similar to models retrained from scratch across various metrics even when the training dataset is no longer accessible.
  arXiv  Detail & Related papers  (2023-12-07T07:17:24Z)
• A Data-Free Approach to Mitigate Catastrophic Forgetting in Federated Class Incremental Learning for Vision Tasks [34.971800168823215]
  This paper presents a framework for $textbffederated class incremental learning$ that utilizes a generative model to synthesize samples from past distributions. To preserve privacy, the generative model is trained on the server using data-free methods at the end of each task without requesting data from clients.
  arXiv  Detail & Related papers  (2023-11-13T22:21:27Z)
• 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)
• Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening [51.34904967046097]
  Selective Synaptic Dampening (SSD) is a fast, performant, and does not require long-term storage of the training data. We present a novel two-step, post hoc, retrain-free approach to machine unlearning which is fast, performant, and does not require long-term storage of the training data.
  arXiv  Detail & Related papers  (2023-08-15T11:30:45Z)
• Privacy Adhering Machine Un-learning in NLP [66.17039929803933]
  In real world industry use Machine Learning to build models on user data. Such mandates require effort both in terms of data as well as model retraining. continuous removal of data and model retraining steps do not scale. We propose textitMachine Unlearning to tackle this challenge.
  arXiv  Detail & Related papers  (2022-12-19T16:06:45Z)
• Machine Unlearning of Features and Labels [72.81914952849334]
  We propose first scenarios for unlearning and labels in machine learning models. Our approach builds on the concept of influence functions and realizes unlearning through closed-form updates of model parameters.
  arXiv  Detail & Related papers  (2021-08-26T04:42:24Z)

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.