Position Bias Estimation for Unbiased Learning to Rank in Personal Search

Xuanhui Wang, Nadav Golbandi, Michael Bendersky, Donald Metzler, Marc Najork
2018 Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining - WSDM '18  
A well-known challenge in learning from click data is its inherent bias and most notably position bias. Traditional click models aim to extract the ⟨query, document⟩ relevance and the estimated bias is usually discarded after relevance is extracted. In contrast, the most recent work on unbiased learning-to-rank can effectively leverage the bias and thus focuses on estimating bias rather than relevance [20, 31] . Existing approaches use search result randomization over a small percentage of
more » ... ction traffic to estimate the position bias. This is not desired because result randomization can negatively impact users' search experience. In this paper, we compare different schemes for result randomization (i.e., RandTopN and RandPair) and show their negative effect in personal search. Then we study how to infer such bias from regular click data without relying on randomization. We propose a regressionbased Expectation-Maximization (EM) algorithm that is based on a position bias click model and that can handle highly sparse clicks in personal search. We evaluate our EM algorithm and the extracted bias in the learning-to-rank setting. Our results show that it is promising to extract position bias from regular clicks without result randomization. The extracted bias can improve the learning-to-rank algorithms significantly. In addition, we compare the pointwise and pairwise learning-to-rank models. Our results show that pairwise models are more effective in leveraging the estimated bias.
doi:10.1145/3159652.3159732 dblp:conf/wsdm/WangGBMN18 fatcat:shszbvbxpbeydit6ik5f5isn7q