论文标题
Fairroad:通过优化的解毒剂数据实现推荐系统的公平性
FairRoad: Achieving Fairness for Recommender Systems with Optimized Antidote Data
论文作者
论文摘要
如今,推荐系统在塑造我们在数字环境和社交互动的经验方面发挥了越来越重要的作用。但是,随着推荐系统在我们的社会中变得无处不在,近年来也见证了推荐系统的明显公平问题。具体而言,研究表明,推荐系统可能会继承甚至扩大历史数据的偏见,因此提供了不公平的建议。为了解决推荐系统中的公平风险,迄今为止,大多数以前的方法都集中在修改现有的培训数据样本或已部署的建议算法上,但不幸的是,成功程度有限。在本文中,我们提出了一种新的方法,称为“公平建议”,并提供了优化的解毒剂数据(Fairroad),该方法旨在通过构建小型且精心设计的解毒剂数据集来提高推荐系统的公平性能。为此,我们将解毒剂数据生成任务作为数学优化问题制定,这使目标推荐系统的不公平性最小化,同时不破坏已部署的建议算法。广泛的实验表明,我们提出的解毒剂数据生成算法可以显着提高推荐系统的公平性,并使用少量的解毒剂数据。
Today, recommender systems have played an increasingly important role in shaping our experiences of digital environments and social interactions. However, as recommender systems become ubiquitous in our society, recent years have also witnessed significant fairness concerns for recommender systems. Specifically, studies have shown that recommender systems may inherit or even amplify biases from historical data, and as a result, provide unfair recommendations. To address fairness risks in recommender systems, most of the previous approaches to date are focused on modifying either the existing training data samples or the deployed recommender algorithms, but unfortunately with limited degrees of success. In this paper, we propose a new approach called fair recommendation with optimized antidote data (FairRoad), which aims to improve the fairness performances of recommender systems through the construction of a small and carefully crafted antidote dataset. Toward this end, we formulate our antidote data generation task as a mathematical optimization problem, which minimizes the unfairness of the targeted recommender systems while not disrupting the deployed recommendation algorithms. Extensive experiments show that our proposed antidote data generation algorithm significantly improve the fairness of recommender systems with a small amounts of antidote data.