SecureCut: Federated Gradient Boosting Decision Trees with Efficient Machine Unlearning
On the map: LLM safety and security → Federated unlearning and poisoning
Abstract (arXiv)
In response to legislation mandating companies to honor the textitright 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., textitmachine 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 textitinstance unlearning and textitfeature 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 textitstate-of-the-art methods. To our best knowledge, this is the first work that investigates machine unlearning in VFL scenarios.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in Federated unlearning and poisoning, one of 12 directions in LLM safety and security. Builds on 14 of its 24 references that are in the map. First posted on arXiv 22 Nov 2023.
Builds on
14 of 24 references.
Closest ancestors · 2
Same direction, newest first
- 2022VeriFi: Towards Verifiable Federated Unlearning25 May
- 2022The Right to be Forgotten in Federated Learning: An Efficient Realization with Rapid Retraining14 Mar
Other references · 12
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2020Extracting Training Data from Large Language Modelscited by 2,144
- 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 847
- 2019Certified Data Removal from Machine Learning Modelscited by 512
- 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
- 2019SecureBoost: A Lossless Federated Learning Frameworkcited by 174
- 2015On Wasserstein Two Sample Testing and Related Families of Nonparametric Testscited by 165
- 2021Adaptive Machine Unlearningcited by 164
- 2020Mixed-Privacy Forgetting in Deep Networkscited by 158
- 2020DeltaGrad: Rapid retraining of machine learning modelscited by 143
- 2020Machine Unlearning for Random Forestscited by 125
- 2021A Coupled Design of Exploiting Record Similarity for Practical Vertical Federated Learningcited by 10
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2024Towards Privacy-Guaranteed Label Unlearning in Vertical Federated Learning: Few-Shot Forgetting without Disclosurecited by 5
- 2025Online Gradient Boosting Decision Tree: In-Place Updates for Efficient Adding/Deleting Datacited by 1
- 2025REMISVFU: Vertical Federated Unlearning via Representation Misdirection for Intermediate Output Featurecited by 1
- 2024A Survey on Federated Unlearning: Challenges and Opportunitiescited by 0
- 2025REMISVFU: Vertical Federated Unlearning via Representation Misdirection for Intermediate Output Feature11 Dec 2025
- 2025Online Gradient Boosting Decision Tree: In-Place Updates for Efficient Adding/Deleting Data3 Feb 2025
- 2024Towards Privacy-Guaranteed Label Unlearning in Vertical Federated Learning: Few-Shot Forgetting without Disclosure14 Oct 2024
- 2024A Survey on Federated Unlearning: Challenges and Opportunities4 Mar 2024