Model-based Unbiased Learning to Rank
Dan Luo, Lixin Zou, Qingyao Ai, Zhiyu Chen, Dawei Yin, Brian D., Davison

TL;DR
This paper introduces a model-based unbiased learning to rank framework that uses a user simulator and doubly robust estimation to improve ranking accuracy under biased user feedback, especially for tail queries.
Contribution
It proposes a novel framework combining a user simulator and inverse propensity weighting to address data sparsity and bias in learning to rank.
Findings
Outperforms state-of-the-art methods on benchmark datasets.
More robust to data sparsity and bias issues.
Effective in various scenarios including tail queries.
Abstract
Unbiased Learning to Rank (ULTR) that learns to rank documents with biased user feedback data is a well-known challenge in information retrieval. Existing methods in unbiased learning to rank typically rely on click modeling or inverse propensity weighting (IPW). Unfortunately, the search engines are faced with severe long-tail query distribution, where neither click modeling nor IPW can handle well. Click modeling suffers from data sparsity problem since the same query-document pair appears limited times on tail queries; IPW suffers from high variance problem since it is highly sensitive to small propensity score values. Therefore, a general debiasing framework that works well under tail queries is in desperate need. To address this problem, we propose a model-based unbiased learning-to-rank framework. Specifically, we develop a general context-aware user simulator to generate pseudo…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Criteria Decision Making
