paper-with-me

홈 › Papers

DynFrs: An Efficient Framework for Machine Unlearning in Random Forest

2024-10-02 · Shurong Wang, Zhuoyang Shen, Xinbao Qiao, Tongning Zhang, Meng Zhang

Random Forests are widely recognized for establishing efficacy in classification and regression tasks, standing out in various domains such as medical diagnosis, finance, and personalized recommendations. These domains, however, are inherently sensitive to privacy concerns, as personal and confidential data are involved. With increasing demand for the right to be forgotten, particularly under regulations such as GDPR and CCPA, the ability to perform machine unlearning has become crucial for Random Forests. However, insufficient attention was paid to this topic, and existing approaches face difficulties in being applied to real-world scenarios. Addressing this gap, we propose the DynFrs framework designed to enable efficient machine unlearning in Random Forests while preserving predictive accuracy. Dynfrs leverages subsampling method Occ(q) and a lazy tag strategy Lzy, and is still adaptable to any Random Forest variant. In essence, Occ(q) ensures that each sample in the training set occurs only in a proportion of trees so that the impact of deleting samples is limited, and Lzy delays the reconstruction of a tree node until necessary, thereby avoiding unnecessary modifications on tree structures. In experiments, applying Dynfrs on Extremely Randomized Trees yields substantial improvements, achieving orders of magnitude faster unlearning performance and better predictive accuracy than existing machine unlearning methods for Random Forests.

📄 PDF Abstract BibTeX arXiv:2410.01588

Code (1)

shurongwang/DynFrs 공식 구현

Tasks

ClassificationMachine Unlearning

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음

Similar Papers 제목 키워드 기반

Example-based Explanations for Random Forests using Machine Unlearning

2024-02-07 · Tanmay Surve, Romila Pradhan

Tree-based machine learning models, such as decision trees and random forests, have been hugely successful in classification tasks primarily because of their predictive power in supervised learning tasks and ease of inte…

FairnessMachine Unlearning

Benchmarking Federated Machine Unlearning methods for Tabular Data

2025-04-01 · Chenguang Xiao, Abhirup Ghosh, Han Wu, Shuo Wang 외

Machine unlearning, which enables a model to forget specific data upon request, is increasingly relevant in the era of privacy-centric machine learning, particularly within federated learning (FL) environments. This pape…

BenchmarkingComputational EfficiencyFederated LearningMachine Unlearning+1

An Investigation on Learning, Polluting, and Unlearning the Spam Emails for Lifelong Learning

2021-11-26 · Nishchal Parne, Kyathi Puppaala, Nithish Bhupathi, Ripon Patgiri

Machine unlearning for security is studied in this context. Several spam email detection methods exist, each of which employs a different algorithm to detect undesired spam emails. But these models are vulnerable to atta…

Lifelong learningMachine UnlearningSpam detection

Machine Unlearning for Random Forests

2020-09-11 · Jonathan Brophy, Daniel Lowd

Responding to user data deletion requests, removing noisy examples, or deleting corrupted training data are just a few reasons for wanting to delete instances from a machine learning (ML) model. However, efficiently remo…

Machine Unlearning

Machine Unlearning in Gradient Boosting Decision Trees

2023-08-04 · KDD 2023 8 · Huawei Lin, Jun Woo Chung, Yingjie Lao, Weijie Zhao

Various machine learning applications take users' data to train the models. Recently enforced legislation requires companies to remove users' data upon requests, i.e.,the right to be forgotten. In the context of machine …

Machine Unlearning