LBD: Decouple Relevance and Observation for Individual-Level Unbiased Learning to Rank
Mouxiang Chen, Chenghao Liu, Zemin Liu, Jianling Sun
Abstract
Using Unbiased Learning to Rank (ULTR) to train the ranking model with biased click logs has attracted increased research interest. The key idea is to explicitly model the user’s observation behavior when building the ranker with a large number of click logs. Considering the simplicity, recent efforts are mainly based on the position bias hypothesis, in which the observation only depends on the position. However, this hypothesis does not hold in many scenarios due to the neglect of the distinct characteristics of individuals in the same position. On the other hand, directly modeling observation bias for each individual is quite challenging, since the effects of each individual’s features on relevance and observation are entangled. It is difficult to ravel out this coupled effect and thus obtain a correct relevance model from click data. To address this issue, we first present the concept of coupling effect for individual-level ULTR. Then, we develop the novel Lipschitz and Bernoulli Decoupling (LBD) model to decouple the effects on relevance and observation at the individual level. We prove theoretically that our proposed method could recover the correct relevance order for the ranking objective. Empirical results on two LTR benchmark datasets show that the proposed model outperforms the state-of-the-art base-lines and verify its effectiveness in debiasing data. Our codes are available at https://github.com/Keytoyze/Lipschitz-Bernoulli-Decoupling .
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 f0950e7a-1dd3-41fc-9dc2-9aa65f467968Builds on5
- 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
- Adapting Interactional Observation Embedding for Counterfactual Learning to RankMouxiang Chen, Chenghao Liu, Jianling Sun, Steven C. H. HoiSIGIR 2021 · 19 citations
- A Deep Recurrent Survival Model for Unbiased RankingJiarui Jin, Yuchen Fang, Weinan Zhang, Kan Ren et al.SIGIR 2020 · 16 citations
- Scalar is Not Enough: Vectorization-based Unbiased Learning to RankMouxiang Chen, Chenghao Liu, Zemin Liu, Jianling SunKDD 2022 · 3 citations
Related papers
- 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
- On the Impact of Outlier Bias on User ClicksFatemeh Sarvi, Ali Vardasbi, Mohammad Aliannejadi, Sebastian Schelter et al.SIGIR 2023 · 6 citations
- Unbiased Learning-to-Rank Needs Unconfounded Propensity EstimationDan Luo, Lixin Zou, Qingyao Ai, Zhiyu Chen et al.SIGIR 2024 · 3 citations
- Distributionally Robust Optimization for Unbiased Learning to RankZechun Niu, Lang Mei, Chong Chen, Jiaxin MaoSIGIR 2025
- Whole Page Unbiased Learning to RankHaitao Mao, Lixin Zou, Yujia Zheng, Jiliang Tang et al.WWW 2024 · 6 citations
