dorsal/arxiv
View SchemaBlindU: Blind Machine Unlearning without Revealing Erasing Data
| Authors | Weiqi Wang, Zhiyi Tian, Chenhan Zhang, Shui Yu |
|---|---|
| Categories | |
| ArXiv ID | 2601.07214vv1 |
| URL | https://arxiv.org/abs/2601.07214 |
| License | http://creativecommons.org/licenses/by-nc-sa/4.0/ |
Abstract
Machine unlearning enables data holders to remove the contribution of their specified samples from trained models to protect their privacy. However, it is paradoxical that most unlearning methods require the unlearning requesters to firstly upload their data to the server as a prerequisite for unlearning. These methods are infeasible in many privacy-preserving scenarios where servers are prohibited from accessing users' data, such as federated learning (FL). In this paper, we explore how to implement unlearning under the condition of not uncovering the erasing data to the server. We propose \textbf{Blind Unlearning (BlindU)}, which carries out unlearning using compressed representations instead of original inputs. BlindU only involves the server and the unlearning user: the user locally generates privacy-preserving representations, and the server performs unlearning solely on these representations and their labels. For the FL model training, we employ the information bottleneck (IB) mechanism. The encoder of the IB-based FL model learns representations that distort maximum task-irrelevant information from inputs, allowing FL users to generate compressed representations locally. For effective unlearning using compressed representation, BlindU integrates two dedicated unlearning modules tailored explicitly for IB-based models and uses a multiple gradient descent algorithm to balance forgetting and utility retaining. While IB compression already provides protection for task-irrelevant information of inputs, to further enhance the privacy protection, we introduce a noise-free differential privacy (DP) masking method to deal with the raw erasing data before compressing. Theoretical analysis and extensive experimental results illustrate the superiority of BlindU in privacy protection and unlearning effectiveness compared with the best existing privacy-preserving unlearning benchmarks.
{
"annotation_id": "503bc3a6-b145-4c32-b9a3-ff08f6801b80",
"date_created": "2026-02-17T05:53:11.759000Z",
"date_modified": "2026-02-17T05:53:11.759000Z",
"file_hash": "1d6defb5c923d441f28851e020cb7eabf449052308c949386d1baa724c4e9c3b",
"private": false,
"record": {
"abstract": "Machine unlearning enables data holders to remove the contribution of their specified samples from trained models to protect their privacy. However, it is paradoxical that most unlearning methods require the unlearning requesters to firstly upload their data to the server as a prerequisite for unlearning. These methods are infeasible in many privacy-preserving scenarios where servers are prohibited from accessing users\u0027 data, such as federated learning (FL). In this paper, we explore how to implement unlearning under the condition of not uncovering the erasing data to the server. We propose \\textbf{Blind Unlearning (BlindU)}, which carries out unlearning using compressed representations instead of original inputs. BlindU only involves the server and the unlearning user: the user locally generates privacy-preserving representations, and the server performs unlearning solely on these representations and their labels. For the FL model training, we employ the information bottleneck (IB) mechanism. The encoder of the IB-based FL model learns representations that distort maximum task-irrelevant information from inputs, allowing FL users to generate compressed representations locally. For effective unlearning using compressed representation, BlindU integrates two dedicated unlearning modules tailored explicitly for IB-based models and uses a multiple gradient descent algorithm to balance forgetting and utility retaining. While IB compression already provides protection for task-irrelevant information of inputs, to further enhance the privacy protection, we introduce a noise-free differential privacy (DP) masking method to deal with the raw erasing data before compressing. Theoretical analysis and extensive experimental results illustrate the superiority of BlindU in privacy protection and unlearning effectiveness compared with the best existing privacy-preserving unlearning benchmarks.",
"arxiv_id": "2601.07214",
"authors": [
"Weiqi Wang",
"Zhiyi Tian",
"Chenhan Zhang",
"Shui Yu"
],
"categories": [
"cs.CR",
"cs.AI",
"cs.CV"
],
"license": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
"title": "BlindU: Blind Machine Unlearning without Revealing Erasing Data",
"url": "https://arxiv.org/abs/2601.07214",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "d5a3e8a2-ea10-4743-b89a-a7883e51e3a0",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}