提出自监督种子机制,实现对真实用户数据删除的可信验证。
SMS: Self-supervised Model Seeding for Verification of Machine Unlearning
- 用用户专属种子连接原始数据与模型,构建可验证的删除链路。
- 在不泄露种子的前提下,将种子嵌入模型隐空间,保障安全性。
- 联合训练保持模型性能,适合需要数据删除验证的应用场景。
近年来,众多机器遗忘方法被提出以保障用户被遗忘权。然而,如何验证数据删除后的真实效果仍是未充分探索的问题。现有验证方法依赖后门攻击,即通过植入后门样本影响模型性能,但此类方法仅能验证后门样本的遗忘状态,无法关联真实用户样本,因真实样本与后门样本独立。本文提出自监督模型播种(SMS)方案,通过将用户特定种子(如用户唯一索引)、原始样本与模型关联,实现对真实样本删除的有效验证。实现面临两大挑战:一是需在不泄露种子的情况下将种子嵌入服务模型,我们采用自监督模型播种任务,学习将完整样本(含种子)编码至模型隐空间;二是需兼顾模型原始性能与播种效果,设计联合训练结构,同时优化自监督播种任务与主任务。大量实验表明,SMS能有效验证真实样本的遗忘状态,弥补现有方法局限。
原文摘要 · Abstract (English)
Many machine unlearning methods have been proposed recently to uphold users' right to be forgotten. However, offering users verification of their data removal post-unlearning is an important yet under-explored problem. Current verifications typically rely on backdooring, i.e., adding backdoored samples to influence model performance. Nevertheless, the backdoor methods can merely establish a connection between backdoored samples and models but fail to connect the backdoor with genuine samples. Thus, the backdoor removal can only confirm the unlearning of backdoored samples, not users' genuine samples, as genuine samples are independent of backdoored ones. In this paper, we propose a Self-supervised Model Seeding (SMS) scheme to provide unlearning verification for genuine samples. Unlike backdooring, SMS links user-specific seeds (such as users' unique indices), original samples, and models, thereby facilitating the verification of unlearning genuine samples. However, implementing SMS for unlearning verification presents two significant challenges. First, embedding the seeds into the service model while keeping them secret from the server requires a sophisticated approach. We address this by employing a self-supervised model seeding task, which learns the entire sample, including the seeds, into the model's latent space. Second, maintaining the utility of the original service model while ensuring the seeding effect requires a delicate balance. We design a joint-training structure that optimizes both the self-supervised model seeding task and the primary service task simultaneously on the model, thereby maintaining model utility while achieving effective model seeding. The effectiveness of the proposed SMS scheme is evaluated through extensive experiments, which demonstrate that SMS provides effective verification for genuine sample unlearning, addressing existing limitations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。