提出训练中防御推荐系统属性推断攻击的新方法,兼顾隐私与推荐效果。
RAID: An In-Training Defense against Attribute Inference Attacks in Recommender Systems
- 通过构造对抗性目标,使用户属性分布与标签独立,实现训练中防御。
- 在四个真实数据集上显著降低攻击成功率,同时保持推荐性能不下降。
- 适合关注推荐系统隐私保护的研究者和工程实践者。
在各类网络和移动应用中,用户极易遭受属性推断攻击,尤其在推荐系统中尤为普遍。攻击者利用推荐模型中暴露的部分用户信息(如用户嵌入)推断目标用户的敏感属性,如性别、政治倾向等。防御目标是在降低攻击成功率的同时,维持推荐性能。现有方法多为训练后防御(如差分隐私、属性遗忘),难以充分利用训练数据优化推荐表现;而对抗训练虽可扩展至训练中,但常因训练不稳定导致收敛困难。本文提出 RAID,一种面向推荐系统的训练中防御方法。在推荐目标之外,引入防御目标,使受保护属性分布与类别标签独立,从而使用户对属性推断攻击不可区分。具体地,该目标通过求解受限的 Wasserstein 算术平均问题,找到满足推荐性能约束下使属性不可区分的中心分布,并利用最优传输将用户对齐至该中心分布。在四个真实数据集上的大量实验验证了 RAID 的有效性,其在多个维度显著优于现有方法。
原文摘要 · Abstract (English)
In various networks and mobile applications, users are highly susceptible to attribute inference attacks, with particularly prevalent occurrences in recommender systems. Attackers exploit partially exposed user profiles in recommendation models, such as user embeddings, to infer private attributes of target users, such as gender and political views. The goal of defenders is to mitigate the effectiveness of these attacks while maintaining recommendation performance. Most existing defense methods, such as differential privacy and attribute unlearning, focus on post-training settings, which limits their capability of utilizing training data to preserve recommendation performance. Although adversarial training extends defenses to in-training settings, it often struggles with convergence due to unstable training processes. In this paper, we propose RAID, an in-training defense method against attribute inference attacks in recommender systems. In addition to the recommendation objective, we define a defensive objective to ensure that the distribution of protected attributes becomes independent of class labels, making users indistinguishable from attribute inference attacks. Specifically, this defensive objective aims to solve a constrained Wasserstein barycenter problem to identify the centroid distribution that makes the attribute indistinguishable while complying with recommendation performance constraints. To optimize our proposed objective, we use optimal transport to align users with the centroid distribution. We conduct extensive experiments on four real-world datasets to evaluate RAID. The experimental results validate the effectiveness of RAID and demonstrate its significant superiority over existing methods in multiple aspects.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。