Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approach
Tao Yang, Cuize Han, Chen Luo, Parth Gupta, Jeff M. Phillips, Qingyao Ai
Abstract
Ranking is at the core of many artificial intelligence (AI) applications, including search engines, recommender systems, etc. Modern ranking systems are often constructed with learning-to-rank (LTR) models built from user behavior signals. While previous studies have demonstrated the effectiveness of using user behavior signals (e.g., clicks) as both features and labels of LTR algorithms, we argue that existing LTR algorithms that indiscriminately treat behavior and non-behavior signals in input features could lead to suboptimal performance in practice. Particularly because user behavior signals often have strong correlations with the ranking objective and can only be collected on items that have already been shown to users, directly using behavior signals in LTR could create an exploitation bias that hurts the system performance in the long run. To address the exploitation bias, we propose EBRank, an empirical Bayes-based uncertainty-aware ranking algorithm. Specifically, to overcome exploitation bias brought by behavior features in ranking models, EBRank uses a sole non-behavior feature based prior model to get a prior estimation of relevance. In the dynamic training and serving of ranking systems, EBRank uses the observed user behaviors to update posterior relevance estimation instead of concatenating behaviors as features in ranking models. Besides, EBRank additionally applies an uncertainty-aware exploration strategy to explore actively, collect user behaviors for empirical Bayesian modeling and improve ranking performance. Experiments on three public datasets show that EBRank is effective, practical and significantly outperforms state-of-the-art ranking algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4c00fdae-d952-4398-b6fa-735825459528Builds on7
- Controlling Fairness and Bias in Dynamic Learning-to-RankMarco Morik, Ashudeep Singh, Jessica Hong, Thorsten JoachimsSIGIR 2020 · 205 citations
- Correcting for Selection Bias in Learning-to-rank SystemsZohreh Ovaisi, Ragib Ahsan, Yifan Zhang, Kathryn Vasilaky et al.WWW 2020 · 123 citations
- Policy-Aware Unbiased Learning to Rank for Top-k RankingsHarrie Oosterhuis, Maarten de RijkeSIGIR 2020 · 60 citations
- Maximizing Marginal Fairness for Dynamic Learning to RankTao Yang, Qingyao AiWWW 2021 · 42 citations
- Can Clicks Be Both Labels and Features?: Unbiased Behavior Feature Collection and Uncertainty-aware Learning to RankTao Yang, Chen Luo, Hanqing Lu, Parth Gupta et al.SIGIR 2022 · 23 citations
Related papers
- Whole Page Unbiased Learning to RankHaitao Mao, Lixin Zou, Yujia Zheng, Jiliang Tang et al.WWW 2024 · 6 citations
- InfoRank: Unbiased Learning-to-Rank via Conditional Mutual Information MinimizationJiarui Jin, Zexue He, Mengyue Yang, Weinan Zhang et al.WWW 2024 · 3 citations
- BayesCNS: A Unified Bayesian Approach to Address Cold Start and Non-Stationarity in Search Systems at ScaleRandy Ardywibowo, Rakesh Sunki, Shin Tsz Lucy Kuo, Sankalp NayakAAAI 2025
- On the Impact of Outlier Bias on User ClicksFatemeh Sarvi, Ali Vardasbi, Mohammad Aliannejadi, Sebastian Schelter et al.SIGIR 2023 · 6 citations
- An Epistemic Position-Based Click Model: From Interactions to Epistemic Distributions of Relevance and BiasOscar Rolando Ramirez Milian, Harrie OosterhuisSIGIR 2026 · 1 citation
