ACU: Analytic Continual Unlearning for Efficient and Exact Forgetting with Privacy Preservation
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909615011135488 |
|---|---|
| author | Tang, Jianheng Zhuang, Huiping Fang, Di Li, Jiaxu Han, Feijiang Huang, Yajiang Fan, Kejia Wang, Leye Zhu, Zhanxing Zhang, Shanghang Song, Houbing Herbert Liu, Yunhuai |
| author_facet | Tang, Jianheng Zhuang, Huiping Fang, Di Li, Jiaxu Han, Feijiang Huang, Yajiang Fan, Kejia Wang, Leye Zhu, Zhanxing Zhang, Shanghang Song, Houbing Herbert Liu, Yunhuai |
| contents | The development of artificial intelligence demands that models incrementally update knowledge by Continual Learning (CL) to adapt to open-world environments. To meet privacy and security requirements, Continual Unlearning (CU) emerges as an important problem, aiming to sequentially forget particular knowledge acquired during the CL phase. However, existing unlearning methods primarily focus on single-shot joint forgetting and face significant limitations when applied to CU. First, most existing methods require access to the retained dataset for re-training or fine-tuning, violating the inherent constraint in CL that historical data cannot be revisited. Second, these methods often suffer from a poor trade-off between system efficiency and model fidelity, making them vulnerable to being overwhelmed or degraded by adversaries through deliberately frequent requests. In this paper, we identify that the limitations of existing unlearning methods stem fundamentally from their reliance on gradient-based updates. To bridge the research gap at its root, we propose a novel gradient-free method for CU, named Analytic Continual Unlearning (ACU), for efficient and exact forgetting with historical data privacy preservation. In response to each unlearning request, our ACU recursively derives an analytical (i.e., closed-form) solution in an interpretable manner using the least squares method. Theoretical and experimental evaluations validate the superiority of our ACU on unlearning effectiveness, model fidelity, and system efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_12239 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | ACU: Analytic Continual Unlearning for Efficient and Exact Forgetting with Privacy Preservation Tang, Jianheng Zhuang, Huiping Fang, Di Li, Jiaxu Han, Feijiang Huang, Yajiang Fan, Kejia Wang, Leye Zhu, Zhanxing Zhang, Shanghang Song, Houbing Herbert Liu, Yunhuai Machine Learning Artificial Intelligence Cryptography and Security The development of artificial intelligence demands that models incrementally update knowledge by Continual Learning (CL) to adapt to open-world environments. To meet privacy and security requirements, Continual Unlearning (CU) emerges as an important problem, aiming to sequentially forget particular knowledge acquired during the CL phase. However, existing unlearning methods primarily focus on single-shot joint forgetting and face significant limitations when applied to CU. First, most existing methods require access to the retained dataset for re-training or fine-tuning, violating the inherent constraint in CL that historical data cannot be revisited. Second, these methods often suffer from a poor trade-off between system efficiency and model fidelity, making them vulnerable to being overwhelmed or degraded by adversaries through deliberately frequent requests. In this paper, we identify that the limitations of existing unlearning methods stem fundamentally from their reliance on gradient-based updates. To bridge the research gap at its root, we propose a novel gradient-free method for CU, named Analytic Continual Unlearning (ACU), for efficient and exact forgetting with historical data privacy preservation. In response to each unlearning request, our ACU recursively derives an analytical (i.e., closed-form) solution in an interpretable manner using the least squares method. Theoretical and experimental evaluations validate the superiority of our ACU on unlearning effectiveness, model fidelity, and system efficiency. |
| title | ACU: Analytic Continual Unlearning for Efficient and Exact Forgetting with Privacy Preservation |
| topic | Machine Learning Artificial Intelligence Cryptography and Security |
| url | https://arxiv.org/abs/2505.12239 |