DeepAI AI Chat
Log In Sign Up

A General Framework for Pairwise Unbiased Learning to Rank

by   Alexey Kurennoy, et al.

Pairwise debiasing is one of the most effective strategies in reducing position bias in learning-to-rank (LTR) models. However, limiting the scope of this strategy, are the underlying assumptions required by many pairwise debiasing approaches. In this paper, we develop an approach based on a minimalistic set of assumptions that can be applied to a much broader range of user browsing patterns and arbitrary presentation layouts. We implement the approach as a simplified version of the Unbiased LambdaMART and demonstrate that it retains the underlying unbiasedness property in a wider variety of settings than the original algorithm. Finally, using simulations with "golden" relevance labels, we will show that the simplified version compares favourably with the original Unbiased LambdaMART when the examination of different positions in a ranked list is not assumed to be independent.


page 1

page 2

page 3

page 4


A Novel Algorithm for Unbiased Learning to Rank

Although click data is widely used in search systems in practice, so far...

Feature-Enhanced Network with Hybrid Debiasing Strategies for Unbiased Learning to Rank

Unbiased learning to rank (ULTR) aims to mitigate various biases existin...

Unbiased Pairwise Learning to Rank in Recommender Systems

Nowadays, recommender systems already impact almost every facet of peopl...

Unbiased Learning to Rank with Biased Continuous Feedback

It is a well-known challenge to learn an unbiased ranker with biased fee...

ARSM Gradient Estimator for Supervised Learning to Rank

We propose a new model for supervised learning to rank. In our model, th...

Reaching the End of Unbiasedness: Uncovering Implicit Limitations of Click-Based Learning to Rank

Click-based learning to rank (LTR) tackles the mismatch between click fr...