TY - GEN
T1 - Towards unbiased and robust causal ranking for recommender systems
AU - Xiao, Teng
AU - Wang, Suhang
N1 - Funding Information:
This work is partially supported by the National Science Foundation (NSF) under grant number IIS-1909702 and IIS1955851, and Army Research Office (ARO) under grant number W911NF-21-1-0198.
Publisher Copyright:
© 2022 ACM.
PY - 2022/2/11
Y1 - 2022/2/11
N2 - We study the problem of optimizing ranking metrics with unbiased and robust causal estimation for recommender systems. A user may click/purchase an item regardless of whether the item is recommended or not. Thus, it is important to estimate the causal effect of recommendation and rank items higher with a larger causal effect. However, most existing works focused on improving the accuracy of recommendations, which usually have large bias and variance. Therefore, in this paper, we provide a general and theoretically rigorous framework for causal recommender systems, which enables unbiased evaluation and learning for the ranking metrics with confounding bias. We first propose a robust estimator for unbiased ranking evaluation and theoretically show that this estimator has a smaller bias and variance. We then propose a deep variational information bottleneck (IB) approach to exploit the sufficiency of the propensity score for estimation adjustment and better generalization. We also provide the learning bound and develop an unbiased learning algorithm to optimize the causal metric. Results on semi-synthetic and real-world datasets show that our evaluation and learning algorithms significantly outperform existing methods.
AB - We study the problem of optimizing ranking metrics with unbiased and robust causal estimation for recommender systems. A user may click/purchase an item regardless of whether the item is recommended or not. Thus, it is important to estimate the causal effect of recommendation and rank items higher with a larger causal effect. However, most existing works focused on improving the accuracy of recommendations, which usually have large bias and variance. Therefore, in this paper, we provide a general and theoretically rigorous framework for causal recommender systems, which enables unbiased evaluation and learning for the ranking metrics with confounding bias. We first propose a robust estimator for unbiased ranking evaluation and theoretically show that this estimator has a smaller bias and variance. We then propose a deep variational information bottleneck (IB) approach to exploit the sufficiency of the propensity score for estimation adjustment and better generalization. We also provide the learning bound and develop an unbiased learning algorithm to optimize the causal metric. Results on semi-synthetic and real-world datasets show that our evaluation and learning algorithms significantly outperform existing methods.
UR - http://www.scopus.com/inward/record.url?scp=85125796729&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85125796729&partnerID=8YFLogxK
U2 - 10.1145/3488560.3498521
DO - 10.1145/3488560.3498521
M3 - Conference contribution
AN - SCOPUS:85125796729
T3 - WSDM 2022 - Proceedings of the 15th ACM International Conference on Web Search and Data Mining
SP - 1158
EP - 1167
BT - WSDM 2022 - Proceedings of the 15th ACM International Conference on Web Search and Data Mining
PB - Association for Computing Machinery, Inc
T2 - 15th ACM International Conference on Web Search and Data Mining, WSDM 2022
Y2 - 21 February 2022 through 25 February 2022
ER -