LGNov 16, 2024

LoRA Unlearns More and Retains More (Student Abstract)

arXiv:2411.11907v11 citationsh-index: 1Has CodeAAAI
Originality Incremental advance
AI Analysis

This addresses privacy and compliance needs in AI by offering a more efficient unlearning technique, though it is incremental as it builds on existing LoRA and pruning methods.

The paper tackles the problem of machine unlearning by proposing PruneLoRA, a method that reduces computational costs and memory requirements while maintaining performance on remaining classes, outperforming other approximate unlearning methods and bridging the gap with exact unlearning.

Due to increasing privacy regulations and regulatory compliance, Machine Unlearning (MU) has become essential. The goal of unlearning is to remove information related to a specific class from a model. Traditional approaches achieve exact unlearning by retraining the model on the remaining dataset, but incur high computational costs. This has driven the development of more efficient unlearning techniques, including model sparsification techniques, which boost computational efficiency, but degrade the model's performance on the remaining classes. To mitigate these issues, we propose a novel method, PruneLoRA which introduces a new MU paradigm, termed prune first, then adapt, then unlearn. LoRA (Hu et al. 2022) reduces the need for large-scale parameter updates by applying low-rank updates to the model. We leverage LoRA to selectively modify a subset of the pruned model's parameters, thereby reducing the computational cost, memory requirements and improving the model's ability to retain performance on the remaining classes. Experimental Results across various metrics showcase that our method outperforms other approximate MU methods and bridges the gap between exact and approximate unlearning. Our code is available at https://github.com/vlgiitr/LoRA-Unlearn.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes