An Offline Metric for the Debiasedness of Click Models
Romain Deffayet, Philipp Hager, Jean-Michel Renders, Maarten de Rijke
Abstract
A well-known problem when learning from user clicks are inherent biases prevalent in the data, such as position or trust bias. Click models are a common method for extracting information from user clicks, such as document relevance in web search, or to estimate click biases for downstream applications such as counterfactual learning-to-rank, ad placement, or fair ranking. Recent work shows that the current evaluation practices in the community fail to guarantee that a well-performing click model generalizes well to downstream tasks in which the ranking distribution differs from the training distribution, i.e., under covariate shift. In this work, we propose an evaluation metric based on conditional independence testing to detect a lack of robustness to covariate shift in click models. We introduce the concept of debiasedness and a metric for measuring it. We prove that debiasedness is a necessary condition for recovering unbiased and consistent relevance scores and for the invariance of click prediction under covariate shift. In extensive semi-synthetic experiments, we show that our proposed metric helps to predict the downstream performance of click models under covariate shift and is useful in an off-policy model selection setting.
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 e01e7544-5432-45c1-b988-afda1807e10aBuilds on7
- Correcting for Selection Bias in Learning-to-rank SystemsZohreh Ovaisi, Ragib Ahsan, Yifan Zhang, Kathryn Vasilaky et al.WWW 2020 · 123 citations
- Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and FairnessHarrie OosterhuisSIGIR 2021 · 68 citations
- Enhanced Doubly Robust Learning for Debiasing Post-Click Conversion Rate EstimationSiyuan Guo, Lixin Zou, Yiding Liu, Wenwen Ye et al.SIGIR 2021 · 63 citations
- Policy-Aware Unbiased Learning to Rank for Top-k RankingsHarrie Oosterhuis, Maarten de RijkeSIGIR 2020 · 60 citations
- A Graph-Enhanced Click Model for Web SearchJianghao Lin, Weiwen Liu, Xinyi Dai, Weinan Zhang et al.SIGIR 2021 · 44 citations
Related papers
- Distributionally Robust Optimization for Unbiased Learning to RankZechun Niu, Lang Mei, Chong Chen, Jiaxin MaoSIGIR 2025
- Off-Policy Evaluation for Ranking Policies under Deterministic Logging PoliciesKoichi Tanaka, Kazuki Kawamura, Takanori Muroi, Yusuke Narita et al.ICLR 2026 · 1 citation
- On the Impact of Outlier Bias on User ClicksFatemeh Sarvi, Ali Vardasbi, Mohammad Aliannejadi, Sebastian Schelter et al.SIGIR 2023 · 6 citations
- Unified Off-Policy Learning to Rank: a Reinforcement Learning PerspectiveZeyu Zhang, Yi Su, Hui Yuan, Yiran Wu et al.NeurIPS 2023 · 9 citations
- Identifiability Matters: Revealing the Hidden Recoverable Condition in Unbiased Learning to RankMouxiang Chen, Chenghao Liu, Zemin Liu, Zhuo Li et al.ICML 2024 · 5 citations
