On the Impact of Outlier Bias on User Clicks
Fatemeh Sarvi, Ali Vardasbi, Mohammad Aliannejadi, Sebastian Schelter, Maarten de Rijke
摘要
User interaction data is an important source of supervision in counterfactual learning to rank (CLTR). Such data suffers from presentation bias. Much work in unbiased learning to rank (ULTR) focuses on position bias, i.e., items at higher ranks are more likely to be examined and clicked. Inter-item dependencies also influence examination probabilities, with outlier items in a ranking as an important example. Outliers are defined as items that observably deviate from the rest and therefore stand out in the ranking. In this paper, we identify and introduce the bias brought about by outlier items: users tend to click more on outlier items and their close neighbors.
To this end, we first conduct a controlled experiment to study the effect of outliers on user clicks. Next, to examine whether the findings from our controlled experiment generalize to naturalistic situations, we explore real-world click logs from an e-commerce platform. We show that, in both scenarios, users tend to click significantly more on outlier items than on non-outlier items in the same rankings. We show that this tendency holds for all positions, i.e., for any specific position, an item receives more interactions when presented as an outlier as opposed to a non-outlier item. We conclude from our analysis that the effect of outliers on clicks is a type of bias that should be addressed in ULTR. We therefore propose an outlieraware click model that accounts for both outlier and position bias, called outlier-aware position-based model (OPBM). We estimate click propensities based on OPBM; through extensive experiments performed on both real-world e-commerce data and semi-synthetic data, we verify the effectiveness of our outlier-aware click model. Our results show the superiority of OPBM against baselines in terms of ranking performance and true relevance estimation.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Going Beyond Popularity and Positivity Bias: Correcting for Multifactorial Bias in Recommender SystemsJin Huang, Harrie Oosterhuis, Masoud Mansoury, Herke van Hoof 等SIGIR 2024 · 被引用 15 次
- Treatment Effect Estimation for User Interest Exploration on Recommender SystemsJiaju Chen, Wenjie Wang, Chongming Gao, Peng Wu 等SIGIR 2024 · 被引用 8 次
- Identifiability Matters: Revealing the Hidden Recoverable Condition in Unbiased Learning to RankMouxiang Chen, Chenghao Liu, Zemin Liu, Zhuo Li 等ICML 2024 · 被引用 5 次
它引用的顶会 Paper5
- Controlling Fairness and Bias in Dynamic Learning-to-RankMarco Morik, Ashudeep Singh, Jessica Hong, Thorsten JoachimsSIGIR 2020 · 被引用 205 次
- Correcting for Selection Bias in Learning-to-rank SystemsZohreh Ovaisi, Ragib Ahsan, Yifan Zhang, Kathryn Vasilaky 等WWW 2020 · 被引用 123 次
- Policy-Aware Unbiased Learning to Rank for Top-k RankingsHarrie Oosterhuis, Maarten de RijkeSIGIR 2020 · 被引用 60 次
- Fairness of Exposure in Light of Incomplete Exposure EstimationMaria Heuss, Fatemeh Sarvi, Maarten de RijkeSIGIR 2022 · 被引用 21 次
- Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in RankingAli Vardasbi, Fatemeh Sarvi, Maarten de RijkeSIGIR 2022 · 被引用 9 次
相关 Paper
- Adapting Interactional Observation Embedding for Counterfactual Learning to RankMouxiang Chen, Chenghao Liu, Jianling Sun, Steven C. H. HoiSIGIR 2021 · 被引用 19 次
- Distributionally Robust Optimization for Unbiased Learning to RankZechun Niu, Lang Mei, Chong Chen, Jiaxin MaoSIGIR 2025
- Unbiased Learning-to-Rank Needs Unconfounded Propensity EstimationDan Luo, Lixin Zou, Qingyao Ai, Zhiyu Chen 等SIGIR 2024 · 被引用 3 次
- Whole Page Unbiased Learning to RankHaitao Mao, Lixin Zou, Yujia Zheng, Jiliang Tang 等WWW 2024 · 被引用 6 次
- LBD: Decouple Relevance and Observation for Individual-Level Unbiased Learning to RankMouxiang Chen, Chenghao Liu, Zemin Liu, Jianling SunNeurIPS 2022 · 被引用 6 次
