Unbiased Learning to Rank Meets Reality: Lessons from Baidu's Large-Scale Search Dataset
- Paper: Unbiased Learning to Rank Meets Reality: Lessons from Baidu's Large-Scale Search Dataset (arXiv:2404.02543)
- Authors: Philipp Hager, Romain Deffayet, Jean-Michel Renders, Onno Zoeter, Maarten de Rijke
- Category: Ranking for Search / Learning to Rank
- The paper examines unbiased learning to rank (ULTR) — methods that correct for position and presentation bias in click data — using large-scale real-world search logs from Baidu's commercial search engine.
- Most prior ULTR research is evaluated on synthetic simulations or small public datasets; this work provides a rare industrial-scale empirical reality check of whether academic ULTR assumptions hold on production data.
- The authors distill practical lessons for deploying bias-corrected ranking models in real search systems, where click logs contain complex presentation effects, noise, and scale-related challenges.
- Deep Learning to Rank in Industrial Search Engines
- A Thorough Comparison of Cross-Encoders and LLMs for Reranking SPLADE
- Adaptive Neural Ranking Framework: Toward Maximized Business Goal
Key points
> Note: The original forum post is a template-style entry; the authoritative source is the paper abstract and PDF at https://arxiv.org/abs/2404.02543. Please consult the paper directly for quantitative results.
Context
Learning-to-rank systems in search engines are typically trained on click logs, which suffer from position bias and other presentation effects. Unbiased LTR aims to correct these biases, e.g., via counterfactual learning or propensity modeling. This paper asks whether methods validated in controlled settings survive contact with real, large-scale industrial click data.