arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.03555cs.LGcs.IRstat.ML
收藏

无在线干预的学习排序一致位置偏差估计

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

Cornell University(康奈尔大学)

Aman Agarwal, Ivan Zaitsev, Thorsten Joachims

摘要:

呈现偏差是从搜索引擎中的隐式反馈中学习时的关键挑战之一,因为它由于排名中的位置、显著性和其他呈现因素而将相关性信号与无信息信号混淆。虽然最近显示了如何反事实的学习排序(LTR)方法\cite{Joachims/etal/17a}可以证明克服演示偏差,如果观察倾向是已知的,它仍然显示如何准确地估计这些倾向。在本文中,我们提出了第一种方法来产生一致的倾向估计没有手动相关性判断,破坏性干预,或限制性的相关性建模假设。我们只需要我们有来自多个不同排名函数的隐式反馈数据。此外,我们认为,我们的估计技术适用于扩展类的上下文基于位置的倾向模型,其中倾向不仅取决于位置,但也可观察到的查询和文档的功能。初步的模拟研究证实,该方法是可扩展的,准确的,和强大的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑