Adapting Interactional Observation Embedding for Counterfactual Learning to Rank
Mouxiang Chen, Chenghao Liu, Jianling Sun, Steven C. H. Hoi
摘要
Counterfactual Learning to Rank (CLTR) becomes an attractive research topic due to its capability of training ranker with click logs. However, CLTR inherently suffers from a large amount of bias caused by confounders, variables that affect both the observation (examination) behavior and click behavior. Recent efforts to correct bias mostly focus on position bias, which assumes that each observation in a ranking list is isolated and only depends on the position. Though effective, users often engage with documents in an interactive manner. Ignoring the interactions between observations/clicks would incur a large interactional observation bias no matter how much data is collected.
In this work, we leverage the embedding method to develop an Interactional Observation-Based Model (IOBM) to estimate the observation probability. We argue that while there exist complex observed and unobserved confounders for observation/click interactions, it is sufficient to use the embedding as a proxy confounder to uncover the relevant information for the prediction of the observation propensity. Moreover, the embedding could offer an alternative to the fully specified generative model for observation and decouples the complex interaction structure of observations/clicks. In our IOBM, we first learn the individual observation embedding to capture position and click information. Then, we learn the interactional observation embedding to uncover their local interaction structure. To filter out irrelevant information and reduce contextual bias, we utilize query context information and propose the intra-observation attention and the inter-observation attention, respectively. We conduct extensive experiments on two LTR benchmark datasets, demonstrating that the proposed IOBM consistently achieves better performance over the baseline models in various click situations and verifying its effectiveness of eliminating interactional observation bias.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Be Aware of the Neighborhood Effect: Modeling Selection Bias under InterferenceHaoxuan Li, Chunyuan Zheng, Sihao Ding, Peng Wu 等ICLR 2024 · 被引用 17 次
- Counteracting Duration Bias in Video Recommendation via Counterfactual Watch TimeHaiyuan Zhao, Guohao Cai, Jieming Zhu, Zhenhua Dong 等KDD 2024 · 被引用 9 次
- LBD: Decouple Relevance and Observation for Individual-Level Unbiased Learning to RankMouxiang Chen, Chenghao Liu, Zemin Liu, Jianling SunNeurIPS 2022 · 被引用 6 次
- Identifiability Matters: Revealing the Hidden Recoverable Condition in Unbiased Learning to RankMouxiang Chen, Chenghao Liu, Zemin Liu, Zhuo Li 等ICML 2024 · 被引用 5 次
- Scalar is Not Enough: Vectorization-based Unbiased Learning to RankMouxiang Chen, Chenghao Liu, Zemin Liu, Jianling SunKDD 2022 · 被引用 3 次
它引用的顶会 Paper5
- SetRank: Learning a Permutation-Invariant Ranking Model for Information RetrievalLiang Pang, Jun Xu, Qingyao Ai, Yanyan Lan 等SIGIR 2020 · 被引用 113 次
- Policy-Aware Unbiased Learning to Rank for Top-k RankingsHarrie Oosterhuis, Maarten de RijkeSIGIR 2020 · 被引用 60 次
- Counterfactual Evaluation of Slate Recommendations with Sequential Reward InteractionsJames McInerney, Brian Brost, Praveen Chandar, Rishabh Mehrotra 等KDD 2020 · 被引用 45 次
- A Deep Recurrent Survival Model for Unbiased RankingJiarui Jin, Yuchen Fang, Weinan Zhang, Kan Ren 等SIGIR 2020 · 被引用 16 次
- Accelerated Convergence for Counterfactual Learning to RankRolf Jagerman, Maarten de RijkeSIGIR 2020 · 被引用 13 次
相关 Paper
- On the Impact of Outlier Bias on User ClicksFatemeh Sarvi, Ali Vardasbi, Mohammad Aliannejadi, Sebastian Schelter 等SIGIR 2023 · 被引用 6 次
- Correcting for Selection Bias in Learning-to-rank SystemsZohreh Ovaisi, Ragib Ahsan, Yifan Zhang, Kathryn Vasilaky 等WWW 2020 · 被引用 123 次
- Distributionally Robust Optimization for Unbiased Learning to RankZechun Niu, Lang Mei, Chong Chen, Jiaxin MaoSIGIR 2025
- Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk MinimizationShashank Gupta, Harrie Oosterhuis, Maarten de RijkeSIGIR 2023 · 被引用 17 次
- Unbiased Learning-to-Rank Needs Unconfounded Propensity EstimationDan Luo, Lixin Zou, Qingyao Ai, Zhiyu Chen 等SIGIR 2024 · 被引用 3 次
