Mitigating Confounding Bias in Recommendation via Information Bottleneck

被引:52
作者
Liu, Dugang [1 ]
Cheng, Pengxiang [2 ]
Zhu, Hong [2 ]
Dong, Zhenhua [2 ]
He, Xiuqiang [2 ]
Pan, Weike [1 ]
Ming, Zhong [1 ]
机构
[1] Shenzhen Univ, Shenzhen, Peoples R China
[2] Huawei Noahs Ark Lab, Shenzhen, Peoples R China
来源
15TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS 2021) | 2021年
基金
中国国家自然科学基金;
关键词
Confounding bias; Causal diagrams; Recommender systems; Information bottleneck;
D O I
10.1145/3460231.3474263
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
How to effectively mitigate the bias of feedback in recommender systems is an important research topic. In this paper, we first describe the generation process of the biased and unbiased feedback in recommender systems via two respective causal diagrams, where the difference between them can be regarded as the source of bias. We then define this difference as a confounding bias, which can be regarded as a collection of some specific biases that have previously been studied. For the case with biased feedback alone, we derive the conditions that need to be satisfied to obtain a debiased representation from the causal diagrams. Based on information theory, we propose a novel method called debiased information bottleneck (DIB) to optimize these conditions and then find a tractable solution for it. In particular, the proposed method constrains the model to learn a biased embedding vector with independent biased and unbiased components in the training phase, and uses only the unbiased component in the test phase to deliver more accurate recommendations. Finally, we conduct extensive experiments on a public dataset and a real product dataset to verify the effectiveness of the proposed method and discuss its properties.
引用
收藏
页码:351 / 360
页数:10
相关论文
共 46 条
[1]   Controlling Popularity Bias in Learning-to-Rank Recommendation [J].
Abdollahpouri, Himan ;
Burke, Robin ;
Mobasher, Bamshad .
PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, :42-46
[2]   Information Dropout: Learning Optimal Representations Through Noisy Computation [J].
Achille, Alessandro ;
Soatto, Stefano .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2018, 40 (12) :2897-2905
[3]   Estimating Position Bias without Intrusive Interventions [J].
Agarwal, Aman ;
Zaitsev, Ivan ;
Wang, Xuanhui ;
Li, Cheng ;
Najork, Marc ;
Joachims, Thorsten .
PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM'19), 2019, :474-482
[4]   Optuna: A Next-generation Hyperparameter Optimization Framework [J].
Akiba, Takuya ;
Sano, Shotaro ;
Yanase, Toshihiko ;
Ohta, Takeru ;
Koyama, Masanori .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :2623-2631
[5]   Causal Embeddings for Recommendation [J].
Bonner, Stephen ;
Vasile, Flavian .
12TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS), 2018, :104-112
[6]   Should I Follow the Crowd? A Probabilistic Analysis of the Effectiveness of Popularity in Recommender Systems [J].
Canamares, Rocio ;
Castells, Pablo .
ACM/SIGIR PROCEEDINGS 2018, 2018, :415-424
[7]  
Cheng P., 2020, P 58 ANN M ASS COMP, P7530
[8]  
Dai B, 2018, PR MACH LEARN RES, V80
[9]  
Federici Marco, 2020, P 8 INT C LEARN REPR
[10]   Understanding Echo Chambers in E-commerce Recommender Systems [J].
Ge, Yingqiang ;
Zhao, Shuya ;
Zhou, Honglu ;
Pei, Changhua ;
Sun, Fei ;
Ou, Wenwu ;
Zhang, Yongfeng .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :2261-2270