提出更贴近现实的推荐系统遗忘评估基准,支持多场景小批量数据删除。
Towards a Real-World Aligned Benchmark for Unlearning in Recommender Systems
- 构建涵盖多种推荐任务的真实遗忘场景与评估框架
- 小批量请求下算法延迟仅数秒,定制算法性能显著优于通用方法
- 强调时序性与效率,适配真实业务中频繁的数据删除需求
现代推荐系统依赖用户交互数据提供个性化服务,但由此带来的隐私合规挑战(如GDPR的被遗忘权)日益突出。机器遗忘(MU)旨在不损害模型性能的前提下,高效移除特定训练数据。然而现有基准(如CURE4Rec)仅聚焦协同过滤,忽略会话推荐与下一篮子推荐等任务,模拟过大规模删除请求,且未考虑实际运行效率。本文提出一套设计原则与研究问题,推动构建更符合真实场景的遗忘评估基准。新基准覆盖多类推荐任务、引入领域特异性遗忘场景,并集成多种算法(含最近NeurIPS竞赛中的方法)。我们强调删除请求的时序性与实时性要求,并在下一篮子推荐任务上进行初步实验:结果显示,针对推荐系统定制的遗忘算法显著优于通用方案,且可在数秒内完成单次删除操作。
原文摘要 · Abstract (English)
Modern recommender systems heavily leverage user interaction data to deliver personalized experiences. However, relying on personal data presents challenges in adhering to privacy regulations, such as the GDPR's "right to be forgotten". Machine unlearning (MU) aims to address these challenges by enabling the efficient removal of specific training data from models post-training, without compromising model utility or leaving residual information. However, current benchmarks for unlearning in recommender systems -- most notably CURE4Rec -- fail to reflect real-world operational demands. They focus narrowly on collaborative filtering, overlook tasks like session-based and next-basket recommendation, simulate unrealistically large unlearning requests, and ignore critical efficiency constraints. In this paper, we propose a set of design desiderata and research questions to guide the development of a more realistic benchmark for unlearning in recommender systems, with the goal of gathering feedback from the research community. Our benchmark proposal spans multiple recommendation tasks, includes domain-specific unlearning scenarios, and several unlearning algorithms -- including ones adapted from a recent NeurIPS unlearning competition. Furthermore, we argue for an unlearning setup that reflects the sequential, time-sensitive nature of real-world deletion requests. We also present a preliminary experiment in a next-basket recommendation setting based on our proposed desiderata and find that unlearning also works for sequential recommendation models, exposed to many small unlearning requests. In this case, we observe that a modification of a custom-designed unlearning algorithm for recommender systems outperforms general unlearning algorithms significantly, and that unlearning can be executed with a latency of only several seconds.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。