English
Related papers

Related papers: Unconfounded Propensity Estimation for Unbiased Ra…

200 papers

Unbiased Learning to Rank (ULTR) aims to train unbiased ranking models from biased click logs, by explicitly modeling a generation process for user behavior and fitting click data based on examination hypothesis. Previous research found…

Information Retrieval · Computer Science 2024-05-27 Mouxiang Chen , Chenghao Liu , Zemin Liu , Zhuo Li , Jianling Sun

The unbiased learning to rank (ULTR) problem has been greatly advanced by recent deep learning techniques and well-designed debias algorithms. However, promising results on the existing benchmark datasets may not be extended to the…

Artificial Intelligence · Computer Science 2022-09-21 Lixin Zou , Haitao Mao , Xiaokai Chu , Jiliang Tang , Wenwen Ye , Shuaiqiang Wang , Dawei Yin

Unbiased Learning to Rank (ULTR) studies the problem of learning a ranking function based on biased user interactions. In this framework, ULTR algorithms have to rely on a large amount of user data that are collected, stored, and aggregated…

Information Retrieval · Computer Science 2021-05-12 Chang Li , Hua Ouyang

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.…

Machine Learning · Computer Science 2018-06-12 Aman Agarwal , Ivan Zaitsev , Thorsten Joachims

Learning-to-rank (LTR) algorithms are ubiquitous and necessary to explore the extensive catalogs of media providers. To avoid the user examining all the results, its preferences are used to provide a subset of relatively small size. The…

Learning to rank with implicit feedback is one of the most important tasks in many real-world information systems where the objective is some specific utility, e.g., clicks and revenue. However, we point out that existing methods based on…

Information Retrieval · Computer Science 2020-11-03 Xinyi Dai , Jiawei Hou , Qing Liu , Yunjia Xi , Ruiming Tang , Weinan Zhang , Xiuqiang He , Jun Wang , Yong Yu

Learning-to-Rank (LTR) models trained from implicit feedback (e.g. clicks) suffer from inherent biases. A well-known one is the position bias -- documents in top positions are more likely to receive clicks due in part to their position…

Information Retrieval · Computer Science 2020-07-21 Mucun Tian , Chun Guo , Vito Ostuni , Zhen Zhu

While implicit feedback (e.g., clicks, dwell times, etc.) is an abundant and attractive source of data for learning to rank, it can produce unfair ranking policies for both exogenous and endogenous reasons. Exogenous reasons typically…

Machine Learning · Computer Science 2021-05-11 Himank Yadav , Zhengxiao Du , Thorsten Joachims

Recent advances in unbiased learning to rank (LTR) count on Inverse Propensity Scoring (IPS) to eliminate bias in implicit feedback. Though theoretically sound in correcting the bias introduced by treating clicked documents as relevant, IPS…

Information Retrieval · Computer Science 2021-11-16 Nan Wang , Zhen Qin , Xuanhui Wang , Hongning Wang

Online learning to rank (OLTR) aims to learn a ranker directly from implicit feedback derived from users' interactions, such as clicks. Clicks however are a biased signal: specifically, top-ranked documents are likely to attract more clicks…

Information Retrieval · Computer Science 2022-01-06 Shengyao Zhuang , Zhihao Qiao , Guido Zuccon

Conventional Learning-to-Rank (LTR) methods optimize the utility of the rankings to the users, but they are oblivious to their impact on the ranked items. However, there has been a growing understanding that the latter is important to…

Machine Learning · Computer Science 2019-06-28 Ashudeep Singh , Thorsten Joachims

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 counterfactual learning-to-rank (LTR) approaches…

Information Retrieval · Computer Science 2018-12-14 Aman Agarwal , Ivan Zaitsev , Xuanhui Wang , Cheng Li , Marc Najork , Thorsten Joachims

Counterfactual learning to rank (CLTR) can be risky and, in various circumstances, can produce sub-optimal models that hurt performance when deployed. Safe CLTR was introduced to mitigate these risks when using inverse propensity scoring to…

Machine Learning · Computer Science 2024-08-08 Shashank Gupta , Harrie Oosterhuis , Maarten de Rijke

Unbiased learning to rank (ULTR) aims to train an unbiased ranking model from biased user click logs. Most of the current ULTR methods are based on the examination hypothesis (EH), which assumes that the click probability can be factorized…

Information Retrieval · Computer Science 2022-06-14 Mouxiang Chen , Chenghao Liu , Zemin Liu , Jianling Sun

Increasing users' positive interactions, such as purchases or clicks, is an important objective of recommender systems. Recommenders typically aim to select items that users will interact with. If the recommended items are purchased, an…

Machine Learning · Computer Science 2020-09-24 Masahiro Sato , Sho Takemori , Janmajay Singh , Tomoko Ohkuma

This tutorial covers and contrasts the two main methodologies in unbiased Learning to Rank (LTR): Counterfactual LTR and Online LTR. There has long been an interest in LTR from user interactions, however, this form of implicit feedback is…

Information Retrieval · Computer Science 2019-07-18 Harrie Oosterhuis , Rolf Jagerman , Maarten de Rijke

The goal of Unsupervised Reinforcement Learning (URL) is to find a reward-agnostic prior policy on a task domain, such that the sample-efficiency on supervised downstream tasks is improved. Although agents initialized with such a prior…

Machine Learning · Computer Science 2023-12-19 Frederik Schubert , Carolin Benjamins , Sebastian Döhler , Bodo Rosenhahn , Marius Lindauer

Besides position bias, which has been well-studied, trust bias is another type of bias prevalent in user interactions with rankings: users are more likely to click incorrectly w.r.t. their preferences on highly ranked items because they…

Information Retrieval · Computer Science 2020-09-10 Ali Vardasbi , Harrie Oosterhuis , Maarten de Rijke

Implicit feedback data, such as user clicks, is commonly used in learning-to-rank (LTR) systems because it is easy to collect and it often reflects user preferences. However, this data is prone to various biases, and training an LTR…

Information Retrieval · Computer Science 2026-01-30 Md Aminul Islam , Kathryn Vasilaky , Elena Zheleva

Generally speaking, the model training for recommender systems can be based on two types of data, namely explicit feedback and implicit feedback. Moreover, because of its general availability, we see wide adoption of implicit feedback data,…

Information Retrieval · Computer Science 2023-04-17 Yi Ren , Hongyan Tang , Jiangpeng Rong , Siwen Zhu