arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2201.06820cs.IRcs.LG
收藏

建议忘却

Recommendation Unlearning

Tsinghua University(清华大学);Alibaba Group(阿里巴巴集团)

Chong Chen, Fei Sun, Min Zhang, Bolin Ding

摘要:

推荐系统通过从收集的数据中学习用户的个人偏好来提供必要的网络服务。然而,在许多情况下,系统也需要忘记一些训练数据。从隐私的角度来看,最近提出了几项隐私法规,要求系统消除所有者请求忘记的数据的任何影响。从效用的角度来看,如果系统的效用被一些坏数据破坏,系统需要忘记这些数据来重新获得效用。从可用性的角度来看,用户可以删除噪音和不正确的条目,以便系统可以提供更有用的建议。虽然不学习是非常重要的,但它在现有的推荐系统中没有得到很好的考虑。虽然有一些研究已经在图像和文本数据领域研究了机器遗忘问题,但是现有的方法由于无法考虑协同信息,不能直接应用于推荐。在本文中,我们提出了RecEraser,一个通用的和有效的机器遗忘框架,专门为推荐任务。RecEraser的主要思想是将训练集划分为多个分片,并为每个分片训练一个组成模型。具体而言,为了保持数据的协作信息,我们首先设计了三种新的数据划分算法,根据它们的相似性将训练数据划分为平衡的组。然后,考虑到不同的碎片模型并不均匀地贡献于最终的预测,我们进一步提出了一种自适应聚合方法,以提高全局模型的效用。在三个公共基准上的实验结果表明,RecEraser不仅可以实现高效的学习,而且在模型效用方面优于最先进的学习方法。源代码可以在https://github.com/chenchongthu/Recommendation-Unlearning上找到

英文摘要:

Recommender systems provide essential web services by learning users' personal preferences from collected data. However, in many cases, systems also need to forget some training data. From the perspective of privacy, several privacy regulations have recently been proposed, requiring systems to eliminate any impact of the data whose owner requests to forget. From the perspective of utility, if a system's utility is damaged by some bad data, the system needs to forget these data to regain utility. From the perspective of usability, users can delete noise and incorrect entries so that a system can provide more useful recommendations. While unlearning is very important, it has not been well-considered in existing recommender systems. Although there are some researches have studied the problem of machine unlearning in the domains of image and text data, existing methods can not been directly applied to recommendation as they are unable to consider the collaborative information. In this paper, we propose RecEraser, a general and efficient machine unlearning framework tailored to recommendation task. The main idea of RecEraser is to partition the training set into multiple shards and train a constituent model for each shard. Specifically, to keep the collaborative information of the data, we first design three novel data partition algorithms to divide training data into balanced groups based on their similarity. Then, considering that different shard models do not uniformly contribute to the final prediction, we further propose an adaptive aggregation method to improve the global model utility. Experimental results on three public benchmarks show that RecEraser can not only achieve efficient unlearning, but also outperform the state-of-the-art unlearning methods in terms of model utility. The source code can be found at https://github.com/chenchongthu/Recommendation-Unlearning

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑