Distributional Fairness-aware Recommendation

Author:

Yang Hao1ORCID,Wu Xian2ORCID,Qiu Zhaopeng2ORCID,Zheng Yefeng2ORCID,Chen Xu1ORCID

Affiliation:

1. Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China

2. Tencent Youtu Lab, Jarvis Research Center, Tencent, Shenzhen, China

Abstract

Fairness has been gradually recognized as a significant problem in the recommendation domain. Previous models usually achieve fairness by reducing the average performance gap between different user groups. However, the average performance may not sufficiently represent all the characteristics of the performances in a user group. Thus, equivalent average performance may not mean the recommender model is fair, for example, the variance of the performances can be different. To alleviate this problem, in this article, we define a novel type of fairness, where we require that the performance distributions across different user groups should be similar. We prove that with the same performance distribution, the numerical characteristics of the group performance, including the expectation, variance, and any higher-order moment, are also the same. To achieve distributional fairness, we propose a generative and adversarial training framework. Specifically, we regard the recommender model as the generator to compute the performance for each user in different groups, and then we deploy a discriminator to judge which group the performance is drawn from. By iteratively optimizing the generator and the discriminator, we can theoretically prove that the optimal generator (the recommender model) can indeed lead to the equivalent performance distributions. To smooth the adversarial training process, we propose a novel dual curriculum learning strategy for optimal scheduling of training samples. Additionally, we tailor our framework to better suit top-N recommendation tasks by incorporating softened ranking metrics as measures of performance discrepancies. We conduct extensive experiments based on real-world datasets to demonstrate the effectiveness of our model.

Funder

National Natural Science Foundation of China

Beijing Outstanding Young Scientist Program

Intelligent Social Governance Platform, Major Innovation & Planning Interdisciplinary Platform

Research Funds of Renmin University of China

Publisher

Association for Computing Machinery (ACM)

Reference98 articles.

1. Artificial Intelligence

2. Mario Arduini Lorenzo Noci Federico Pirovano Ce Zhang Yash Raj Shrestha and Bibek Paudel. 2020. Adversarial learning for debiasing knowledge graph embeddings. Retrieved from https://arXiv:2006.16309

3. Martin Arjovsky and Léon Bottou. 2017. Towards principled methods for training generative adversarial networks. Retrieved from https://arXiv:1701.04862

4. Privacy-Aware Recommendation with Private-Attribute Protection using Adversarial Learning

5. Alex Beutel Jilin Chen Zhe Zhao and Ed H. Chi. 2017. Data decisions and theoretical implications when adversarially learning fair representations. Retrieved from https://arXiv:1707.00075

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3