无需标注成员身份,用对比学习实现更隐蔽的模型成员攻击
CLMIA: Membership Inference Attacks via Unsupervised Contrastive Learning
- 用无监督对比学习构建攻击模型,无需额外成员标签
- 仅需少量已知身份数据微调,攻击效果优于现有方法
- 在标签稀疏场景下表现更优,更贴近真实应用
由于机器学习模型常在有限数据集上训练,导致模型多次重复使用相同样本,从而记忆大部分训练数据。成员推断攻击(MIAs)正是利用这一特性,判断某数据样本是否被用于模型训练。然而在现实场景中,攻击者往往难以获取足够多带有准确身份标记的样本,尤其当非成员样本占多数时更为困难。为此,本文提出一种新攻击方法CLMIA,采用无监督对比学习训练攻击模型,无需额外的成员身份信息。同时,仅需少量已知成员身份的数据即可对攻击模型进行微调。实验表明,CLMIA在多种数据集和模型结构下均优于现有攻击方法,尤其在身份标记信息较少的情况下表现更佳。进一步分析发现,攻击效果随标记数据比例降低而提升,这使其更适用于真实世界中标签稀缺的场景。
原文摘要 · Abstract (English)
Since machine learning model is often trained on a limited data set, the model is trained multiple times on the same data sample, which causes the model to memorize most of the training set data. Membership Inference Attacks (MIAs) exploit this feature to determine whether a data sample is used for training a machine learning model. However, in realistic scenarios, it is difficult for the adversary to obtain enough qualified samples that mark accurate identity information, especially since most samples are non-members in real world applications. To address this limitation, in this paper, we propose a new attack method called CLMIA, which uses unsupervised contrastive learning to train an attack model without using extra membership status information. Meanwhile, in CLMIA, we require only a small amount of data with known membership status to fine-tune the attack model. Experimental results demonstrate that CLMIA performs better than existing attack methods for different datasets and model structures, especially with data with less marked identity information. In addition, we experimentally find that the attack performs differently for different proportions of labeled identity information for member and non-member data. More analysis proves that our attack method performs better with less labeled identity information, which applies to more realistic scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。