Unbiased Learning to Rank: On Recent Advances and Practical Applications
Since its inception, the field of unbiased learning to rank (ULTR) has remained very active
and has seen several impactful advancements in recent years. This tutorial provides both an …
and has seen several impactful advancements in recent years. This tutorial provides both an …
Marginal-certainty-aware fair ranking algorithm
Ranking systems are ubiquitous in modern Internet services, including online marketplaces,
social media, and search engines. Traditionally, ranking systems only focus on how to get …
social media, and search engines. Traditionally, ranking systems only focus on how to get …
Pre-trained language model-based retrieval and ranking for web search
Pre-trained language representation models (PLMs) such as BERT and Enhanced
Representation through kNowledge IntEgration (ERNIE) have been integral to achieving …
Representation through kNowledge IntEgration (ERNIE) have been integral to achieving …
Unbiased Learning-to-Rank Needs Unconfounded Propensity Estimation
The logs of the use of a search engine provide sufficient data to train a better ranker.
However, it is well known that such implicit feedback reflects biases, and in particular a …
However, it is well known that such implicit feedback reflects biases, and in particular a …
Approximated doubly robust search relevance estimation
Extracting query-document relevance from the sparse, biased clickthrough log is among the
most fundamental tasks in the web search system. Prior art mainly learns a relevance …
most fundamental tasks in the web search system. Prior art mainly learns a relevance …
Unconfounded Propensity Estimation for Unbiased Ranking
The goal of unbiased learning to rank (ULTR) is to leverage implicit user feedback for
optimizing learning-to-rank systems. Among existing solutions, automatic ULTR algorithms …
optimizing learning-to-rank systems. Among existing solutions, automatic ULTR algorithms …
[PDF][PDF] A Self-Distilled Learning to Rank Model for Ad-hoc Retrieval
S Keshvari, F Saeedi, H Sadoghi Yazdi… - ACM Transactions on …, 2024 - researchgate.net
Authors' addresses: Sanaz Keshvari, Ferdowsi University of Mashhad, Mashhad, Iran,;
Farzan Saeedi, Ferdowsi University of Mashhad, Mashhad, Iran,; Hadi Sadoghi Yazdi …
Farzan Saeedi, Ferdowsi University of Mashhad, Mashhad, Iran,; Hadi Sadoghi Yazdi …
CIR at the NTCIR-17 ULTRE-2 Task
The Chinese academy of sciences Information Retrieval team (CIR) has participated in the
NTCIR-17 ULTRE-2 task. This paper describes our approaches and reports our results on …
NTCIR-17 ULTRE-2 task. This paper describes our approaches and reports our results on …
Investigating the Robustness of Counterfactual Learning to Rank Models: A Reproducibility Study
Counterfactual learning to rank (CLTR) has attracted extensive attention in the IR community
for its ability to leverage massive logged user interaction data to train ranking models. While …
for its ability to leverage massive logged user interaction data to train ranking models. While …
Baby Bear: Seeking a Just Right Rating Scale for Scalar Annotations
Our goal is a mechanism for efficiently assigning scalar ratings to each of a large set of
elements. For example," what percent positive or negative is this product review?" When …
elements. For example," what percent positive or negative is this product review?" When …