Affiliation:
1. Department of computer science and technology, Tsinghua University, Beijing, China
2. School of Cyber Science and Engineering, Wuhan University, Wuhan, China
3. Baidu Inc, Beijing China
4. Beijing Key Laboratory, Big Data Management and Analysis Methods, Beijing, China and Gaoling School of Artificial Intelligence, Renmin University of China, Beijing China
5. Dept. of Computer Science & Technology, Tsinghua University, Beijing, China
Abstract
User behavior data, such as ratings and clicks, has been widely used to build personalizing models for recommender systems. However, many unflattering factors (e.g., popularity, ranking position, users’ selection) significantly affect the performance of the learned recommendation model. Most existing work on unbiased recommendation addressed these biases from sample granularity (e.g., sample reweighting, data augmentation) or from the perspective of representation learning (e.g., bias-modeling). However, these methods are usually designed for a specific bias, lacking the universal capability to handle complex situations where multiple biases co-exist. Besides, rare work frees itself from laborious and sophisticated debiasing configurations (e.g., propensity scores, imputed values, or user behavior-generating process).
Towards this research gap, in this article, we propose a universal
G
enerative framework for
B
ias
D
isentanglement termed as
GBD
, constantly generating calibration perturbations for the intermediate representations during training to keep them from being affected by the bias. Specifically, a bias-identifier that tries to retrieve the bias-related information from the representations is first introduced. Subsequently, the calibration perturbations are generated to significantly deteriorate the bias-identifier’s performance, making the bias gradually disentangled from the calibrated representations. Therefore, without relying on notorious debiasing configurations, a bias-agnostic model is obtained under the guidance of the bias identifier. We further present its universality by subsuming the representative biases and their mixture under the proposed framework. Finally, extensive experiments on the real-world, synthetic, and semi-synthetic datasets have demonstrated the superiority of the proposed approach against a wide range of recommendation debiasing methods. The code is available at
https://github.com/Zhidan-Wang/GBD
.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Hubei Province, China
Publisher
Association for Computing Machinery (ACM)
Reference66 articles.
1. Controlling Popularity Bias in Learning-to-Rank Recommendation
2. Himan Abdollahpouri, Robin Burke, and Bamshad Mobasher. 2019. Managing popularity bias in recommender systems with personalized re-ranking. In Proceedings of the 32nd International Flairs Conference.
3. Multi-sided exposure bias in recommendation;Abdollahpouri Himan;arXiv:2006.15772,2020
4. A General Framework for Counterfactual Learning-to-Rank
5. Addressing Trust Bias for Unbiased Learning-to-Rank
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献