Debiased Explainable Pairwise Ranking from Implicit Feedback

被引:12
作者
Damak, Khalil [1 ]
Khenissi, Sami [1 ]
Nasraoui, Olfa [1 ]
机构
[1] Univ Louisville, Knowledge Discovery & Web Min Lab, Dept Comp Sci & Engn, Louisville, KY 40292 USA
来源
15TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS 2021) | 2021年
基金
美国国家科学基金会;
关键词
Fairness in AI; Debiased Machine Learning; Pairwise Ranking; Explainability; Exposure Bias;
D O I
10.1145/3460231.3474274
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recent work in recommender systems has emphasized the importance of fairness, with a particular interest in bias and transparency, in addition to predictive accuracy. In this paper, we focus on the state of the art pairwise ranking model, Bayesian Personalized Ranking (BPR), which has previously been found to outperform pointwise models in predictive accuracy, while also being able to handle implicit feedback. Specifically, we address two limitations of BPR: (1) BPR is a black box model that does not explain its outputs, thus limiting the user's trust in the recommendations, and the analyst's ability to scrutinize a model's outputs; and (2) BPR is vulnerable to exposure bias due to the data being Missing Not At Random (MNAR). This exposure bias usually translates into an unfairness against the least popular items because they risk being under-exposed by the recommender system. In this work, we first propose a novel explainable loss function and a corresponding Matrix Factorization-based model called Explainable Bayesian Personalized Ranking (EBPR) that generates recommendations along with item-based explanations. Then, we theoretically quantify additional exposure bias resulting from the explainability, and use it as a basis to propose an unbiased estimator for the ideal EBPR loss. The result is a ranking model that aptly captures both debiased and explainable user preferences. Finally, we perform an empirical study on three real-world datasets that demonstrate the advantages of our proposed models.
引用
收藏
页码:321 / 331
页数:11
相关论文
共 53 条
[41]   Interpretable Convolutional Neural Networks with Dual Local and Global Attention for Review Rating Prediction [J].
Seo, Sungyong ;
Huang, Jing ;
Yang, Hao ;
Liu, Yan .
PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, :297-305
[42]  
Shuo Wang, 2018, Data Mining and Big Data. Third International Conference, DMBD 2018. Proceedings: LNCS 10943, P102, DOI 10.1007/978-3-319-93803-5_10
[43]   Debiasing the Human-Recommender System Feedback Loop in Collaborative Filtering [J].
Sun, Wenlong ;
Khenissi, Sami ;
Nasraoui, Olfa ;
Shafto, Patrick .
COMPANION OF THE WORLD WIDE WEB CONFERENCE (WWW 2019 ), 2019, :645-651
[44]   A survey of explanations in recommender systems [J].
Tintarev, Nava ;
Masthoff, Judith .
2007 IEEE 23RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOP, VOLS 1-2, 2007, :801-810
[45]  
Vargas S, 2011, P 5 ACM C REC SYST, P109, DOI [DOI 10.1145/2043932.2043955, 10.1145/2043932.2043955]
[46]   Reinforced Negative Sampling over Knowledge Graph for Recommendation [J].
Wang, Xiang ;
Xu, Yaokun ;
He, Xiangnan ;
Cao, Yixin ;
Wang, Meng ;
Chua, Tat-Seng .
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, :99-109
[47]   Entire Space Multi-Task Modeling via Post-Click Behavior Decomposition for Conversion Rate Prediction [J].
Wen, Hong ;
Zhang, Jing ;
Wang, Yuan ;
Lv, Fuyu ;
Bao, Wentian ;
Lin, Quan ;
Yang, Keping .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :2377-2386
[48]  
Yahoo!, YAH WEBSC DAT YDAT Y
[49]   Unbiased Offline Recommender Evaluation for Missing-Not-At-Random Implicit Feedback [J].
Yang, Longqi ;
Cui, Yin ;
Xuan, Yuan ;
Wang, Chenyang ;
Belongie, Serge ;
Estrin, Deborah .
12TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS), 2018, :279-287
[50]  
Yu Hsiang-Fu, 2017, PROC SIAM INT C DATA, P363