Machine Unlearning with Minimal Gradient Dependence for High Unlearning Ratios
원문 초록
In the context of machine unlearning, the primary challenge lies in effectively removing traces of private data from trained models while maintaining model performance and security against privacy attacks like membership inference attacks. Traditional gradient-based unlearning methods often rely on extensive historical gradients, which becomes impractical with high unlearning ratios and may reduce the effectiveness of unlearning. Addressing these limitations, we introduce Mini-Unlearning, a novel approach that capitalizes on a critical observation: unlearned parameters correlate with retrained parameters through contraction mapping. Our method, Mini-Unlearning, utilizes a minimal subset of historical gradients and leverages this contraction mapping to facilitate scalable, efficient unlearning. This lightweight, scalable method significantly enhances model accuracy and strengthens resistance to membership inference attacks. Our experiments demonstrate that Mini-Unlearning not only works under higher unlearning ratios but also outperforms existing techniques in both accuracy and security, offering a promising solution for applications requiring robust unlearning capabilities.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Model State Arithmetic for Machine Unlearning
Rectifying Privacy and Efficacy Measurements in Machine Unlearning: A New Inference Attack Perspective
Membership Inference Attacks as Privacy Tools: Reliability, Disparity and Ensemble
Unlearning Isn't Invisible: Detecting Unlearning Traces in LLMs from Model Outputs
Apollo: A Posteriori Label-Only Membership Inference Attack Towards Machine Unlearning
Certified Unlearning for Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.