Affiliation:
1. University of Queensland, Brisbane, Australia
2. University of Adelaide, Adelaide, Australia
Abstract
Dynamic Learning-to-Rank (DLTR) is a method of updating a ranking policy in real-time based on user feedback, which may not always be accurate. Although previous DLTR work has achieved fair and unbiased DLTR under inaccurate feedback, they face the trade-off between fairness and user utility and also have limitations in the setting of feeding items. Existing DLTR works improve ranking utility by eliminating bias from inaccurate feedback on observed items, but the impact of another pervasive form of inaccurate feedback, overlooked or ignored interesting items, remains unclear. For example, users may browse the rankings too quickly to catch interesting items or miss interesting items because the snippets are not optimized enough. This phenomenon raises two questions: i)
Will overlooked interesting items affect the ranking results?
ii)
Is it possible to improve utility without sacrificing fairness if these effects are eliminated?
These questions are particularly relevant for small and medium-sized retailers who are just starting out and may have limited data, leading to the use of inaccurate feedback to update their models. In this paper, we find that inaccurate feedback in the form of overlooked interesting items has a negative impact on DLTR performance in terms of utility. To address this, we treat the overlooked interesting items as noise and propose a novel DLTR method, the Co-teaching Rank (CoTeR), that has good utility and fairness performance when inaccurate feedback is present in the form of overlooked interesting items. Our solution incorporates a co-teaching-based component with a customized loss function and data sampling strategy, as well as a mean pooling strategy to further accommodate newly added products without historical data. Through experiments, we demonstrate that CoTeRx not only enhances utilities but also preserves ranking fairness, and can smoothly handle newly introduced items.
Publisher
Association for Computing Machinery (ACM)
Reference78 articles.
1. Aman Agarwal Kenta Takatsu Ivan Zaitsev and Thorsten Joachims. 2019. A General Framework for Counterfactual Learning-to-Rank. In SIGIR.
2. Qingyao Ai Keping Bi Cheng Luo Jiafeng Guo and W. Bruce Croft. 2018. Unbiased Learning to Rank with Unbiased Propensity Estimation. In SIGIR.
3. Devansh Arpit Stanisław Jastrzębski Nicolas Ballas David Krueger Emmanuel Bengio Maxinder S. Kanwal Tegan Maharaj Asja Fischer Aaron Courville Yoshua Bengio and Simon Lacoste-Julien. 2017. A Closer Look at Memorization in Deep Networks. In ICML.
4. Ricardo Baeza-Yates. 2020. Bias in Search and Recommender Systems. In RecSys.
5. Representation Learning: A Review and New Perspectives