pith. sign in

arxiv: 1806.03555 · v1 · pith:OBCJF5LPnew · submitted 2018-06-09 · 💻 cs.LG · cs.IR· stat.ML

Consistent Position Bias Estimation without Online Interventions for Learning-to-Rank

classification 💻 cs.LG cs.IRstat.ML
keywords biaspositionpresentationpropensitiesrelevanceconsistentestimationfeedback
0
0 comments X
read the original abstract

Presentation bias is one of the key challenges when learning from implicit feedback in search engines, as it confounds the relevance signal with uninformative signals due to position in the ranking, saliency, and other presentation factors. While it was recently shown how counterfactual learning-to-rank (LTR) approaches \cite{Joachims/etal/17a} can provably overcome presentation bias if observation propensities are known, it remains to show how to accurately estimate these propensities. In this paper, we propose the first method for producing consistent propensity estimates without manual relevance judgments, disruptive interventions, or restrictive relevance modeling assumptions. We merely require that we have implicit feedback data from multiple different ranking functions. Furthermore, we argue that our estimation technique applies to an extended class of Contextual Position-Based Propensity Models, where propensities not only depend on position but also on observable features of the query and document. Initial simulation studies confirm that the approach is scalable, accurate, and robust.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Unbiased Learning to Rank: Counterfactual and Online Approaches

    cs.IR 2019-07 unverdicted novelty 2.0

    Tutorial overview contrasting counterfactual and online approaches to unbiased learning to rank.