Unbiased learning-to-rank with biased feedback

T Joachims, A Swaminathan, T Schnabel - Proceedings of the tenth …, 2017 - dl.acm.org
Implicit feedback (eg, clicks, dwell times, etc.) is an abundant source of data in human-
interactive systems. While implicit feedback has many advantages (eg, it is inexpensive to …

Unbiased learning to rank with unbiased propensity estimation

Q Ai, K Bi, C Luo, J Guo, WB Croft - The 41st international ACM SIGIR …, 2018 - dl.acm.org
Learning to rank with biased click data is a well-known challenge. A variety of methods has
been explored to debias click data for learning to rank such as click models, result …

Addressing trust bias for unbiased learning-to-rank

A Agarwal, X Wang, C Li, M Bendersky… - The World Wide Web …, 2019 - dl.acm.org
Existing unbiased learning-to-rank models use counterfactual inference, notably Inverse
Propensity Scoring (IPS), to learn a ranking function from biased click data. They handle the …

Estimating position bias without intrusive interventions

A Agarwal, I Zaitsev, X Wang, C Li, M Najork… - Proceedings of the …, 2019 - dl.acm.org
Presentation bias is one of the key challenges when learning from implicit feedback in
search engines, as it confounds the relevance signal. While it was recently shown how …

Controlling fairness and bias in dynamic learning-to-rank

M Morik, A Singh, J Hong, T Joachims - Proceedings of the 43rd …, 2020 - dl.acm.org
Rankings are the primary interface through which many online platforms match users to
items (eg news, products, music, video). In these two-sided markets, not only the users draw …

Position bias estimation for unbiased learning to rank in personal search

X Wang, N Golbandi, M Bendersky, D Metzler… - Proceedings of the …, 2018 - dl.acm.org
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 …

Unbiased lambdamart: an unbiased pairwise learning-to-rank algorithm

Z Hu, Y Wang, Q Peng, H Li - The World Wide Web Conference, 2019 - dl.acm.org
Recently a number of algorithms under the theme of'unbiased learning-to-rank'have been
proposed, which can reduce position bias, the major type of bias in click data, and train a …

Unifying online and counterfactual learning to rank: A novel counterfactual estimator that effectively utilizes online interventions

H Oosterhuis, M de Rijke - Proceedings of the 14th ACM international …, 2021 - dl.acm.org
Optimizing ranking systems based on user interactions is a well-studied problem. State-of-
the-art methods for optimizing ranking systems based on user interactions are divided into …

Reusing historical interaction data for faster online learning to rank for IR

K Hofmann, A Schuth, S Whiteson… - Proceedings of the sixth …, 2013 - dl.acm.org
Online learning to rank for information retrieval (IR) holds promise for allowing the
development of" self-learning" search engines that can automatically adjust to their users …

[PDF][PDF] Minimally invasive randomization for collecting unbiased preferences from clickthrough logs

F Radlinski, T Joachims - Proceedings of the national conference on …, 2006 - cdn.aaai.org
Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit
relevance feedback for improving and personalizing search engines. However, it is well …