Constrained Off-policy Learning over Heterogeneous Information for Fairness-aware Recommendation

Xiangmeng Wang, Qian Li, Dianer Yu, Qing Li, Guandong Xu
{"title":"Constrained Off-policy Learning over Heterogeneous Information for Fairness-aware Recommendation","authors":"Xiangmeng Wang, Qian Li, Dianer Yu, Qing Li, Guandong Xu","doi":"10.1145/3629172","DOIUrl":null,"url":null,"abstract":"Fairness-aware recommendation eliminates discrimination issues to build trustworthy recommendation systems. Existing fairness-aware approaches ignore accounting for rich user and item attributes and thus cannot capture the impact of attributes on affecting recommendation fairness. These real-world attributes severely cause unfair recommendations by favoring items with popular attributes, leading to item exposure unfairness in recommendations. Moreover, existing approaches mostly mitigate unfairness for static recommendation models, e.g., collaborative filtering. Static models can not handle dynamic user interactions with the system that reflect users’ preferences shift through time. Thus, static models are limited in their ability to adapt to user behavior shifts to gain long-run user satisfaction. As user and item attributes are largely involved in modern recommenders and user interactions are naturally dynamic, it is essential to develop a novel method that eliminates unfairness caused by attributes meanwhile embrace the dynamic modeling of user behavior shifts. In this paper, we propose Constrained Off-policy Learning over Heterogeneous Information for Fairness-aware Recommendation (Fair-HINpolicy) , which uses recent advances in context-aware off-policy learning to produce fairness-aware recommendations with rich attributes from a Heterogeneous Information Network. In particular, we formulate the off-policy learning as a Constrained Markov Decision Process (CMDP) by dynamically constraining the fairness of item exposure at each iteration. We also design an attentive action sampling to reduce the search space for off-policy learning. Our solution adaptively receives HIN-augmented corrections for counterfactual risk minimization, and ultimately yields an effective policy that maximizes long-term user satisfaction. We extensively evaluate our method through simulations on large-scale real-world datasets, obtaining favorable results compared with state-of-the-art methods.","PeriodicalId":474833,"journal":{"name":"ACM Transactions on Recommender Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Recommender Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3629172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Fairness-aware recommendation eliminates discrimination issues to build trustworthy recommendation systems. Existing fairness-aware approaches ignore accounting for rich user and item attributes and thus cannot capture the impact of attributes on affecting recommendation fairness. These real-world attributes severely cause unfair recommendations by favoring items with popular attributes, leading to item exposure unfairness in recommendations. Moreover, existing approaches mostly mitigate unfairness for static recommendation models, e.g., collaborative filtering. Static models can not handle dynamic user interactions with the system that reflect users’ preferences shift through time. Thus, static models are limited in their ability to adapt to user behavior shifts to gain long-run user satisfaction. As user and item attributes are largely involved in modern recommenders and user interactions are naturally dynamic, it is essential to develop a novel method that eliminates unfairness caused by attributes meanwhile embrace the dynamic modeling of user behavior shifts. In this paper, we propose Constrained Off-policy Learning over Heterogeneous Information for Fairness-aware Recommendation (Fair-HINpolicy) , which uses recent advances in context-aware off-policy learning to produce fairness-aware recommendations with rich attributes from a Heterogeneous Information Network. In particular, we formulate the off-policy learning as a Constrained Markov Decision Process (CMDP) by dynamically constraining the fairness of item exposure at each iteration. We also design an attentive action sampling to reduce the search space for off-policy learning. Our solution adaptively receives HIN-augmented corrections for counterfactual risk minimization, and ultimately yields an effective policy that maximizes long-term user satisfaction. We extensively evaluate our method through simulations on large-scale real-world datasets, obtaining favorable results compared with state-of-the-art methods.
基于异构信息的非策略约束学习的公平性感知推荐
公平感知推荐消除了歧视问题,构建了值得信赖的推荐系统。现有的公平感知方法忽略了对丰富的用户和项目属性的考虑,因此无法捕捉属性对推荐公平性的影响。这些真实世界的属性会偏爱具有流行属性的项目,从而严重导致不公平的推荐,从而导致推荐中的项目暴露不公平。此外,现有的方法大多减轻了静态推荐模型的不公平性,例如协同过滤。静态模型不能处理反映用户偏好随时间变化的系统的动态用户交互。因此,静态模型在适应用户行为变化以获得长期用户满意度方面的能力是有限的。由于现代推荐系统中大量涉及用户和商品属性,且用户交互是自然动态的,因此开发一种既能消除属性带来的不公平,又能对用户行为变化进行动态建模的新方法十分必要。在本文中,我们提出了基于异构信息的约束脱策略学习,用于公平感知推荐(Fair-HINpolicy),它利用上下文感知脱策略学习的最新进展,从异构信息网络中生成具有丰富属性的公平感知推荐。特别是,我们通过在每次迭代中动态约束项目暴露的公平性,将离策略学习制定为约束马尔可夫决策过程(CMDP)。我们还设计了一个细心的动作采样来减少非策略学习的搜索空间。我们的解决方案自适应地接收hin增强修正,以使反事实风险最小化,并最终产生一个有效的策略,最大限度地提高长期用户满意度。我们通过大规模真实世界数据集的模拟广泛评估了我们的方法,与最先进的方法相比,获得了良好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书