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 …

Unbiased learning to rank: online or offline?

Q Ai, T Yang, H Wang, J Mao - ACM Transactions on Information …, 2021 - dl.acm.org
How to obtain an unbiased ranking model by learning to rank with biased user feedback is
an important research question for IR. Existing work on unbiased learning to rank (ULTR) …

Can clicks be both labels and features? Unbiased Behavior Feature Collection and Uncertainty-aware Learning to Rank

T Yang, C Luo, H Lu, P Gupta, B Yin, Q Ai - Proceedings of the 45th …, 2022 - dl.acm.org
Using implicit feedback collected from user clicks as training labels for learning-to-rank
algorithms is a well-developed paradigm that has been extensively studied and used in …

Marginal-certainty-aware fair ranking algorithm

T Yang, Z Xu, Z Wang, A Tran, Q Ai - … on Web Search and Data Mining, 2023 - dl.acm.org
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 …

On the value of prior in online learning to rank

B Kveton, O Meshi, M Zoghi… - … Conference on Artificial …, 2022 - proceedings.mlr.press
This paper addresses the cold-start problem in online learning to rank (OLTR). We show
both theoretically and empirically that priors improve the quality of ranked lists presented to …

Efficient online learning to rank for sequential music recommendation

PDV Chaves, BL Pereira, RLT Santos - Proceedings of the ACM Web …, 2022 - dl.acm.org
Music streaming services heavily rely upon recommender systems to acquire, engage, and
retain users. One notable component of these services are playlists, which can be …

Gemini: Learning to manage cpu power for latency-critical search engines

L Zhou, LN Bhuyan… - 2020 53rd Annual IEEE …, 2020 - ieeexplore.ieee.org
Saving energy for latency-critical applications like web search can be challenging because
of their strict tail latency constraints. State-of-the-art power management frameworks use …

Learning from user interactions with rankings: a unification of the field

H Oosterhuis - arXiv preprint arXiv:2012.06576, 2020 - arxiv.org
Ranking systems form the basis for online search engines and recommendation services.
They process large collections of items, for instance web pages or e-commerce products …

A deep actor critic reinforcement learning framework for learning to rank

V Padhye, K Lakshmanan - Neurocomputing, 2023 - Elsevier
In this paper, we propose a Deep Reinforcement learning based approach for Learning to
rank task. Reinforcement Learning has been applied in the ranking task with good success …

Set2setRank: Collaborative set to set ranking for implicit feedback based recommendation

L Chen, L Wu, K Zhang, R Hong, M Wang - Proceedings of the 44th …, 2021 - dl.acm.org
As users often express their preferences with binary behavior data~(implicit feedback), such
as clicking items or buying products, implicit feedback based Collaborative Filtering~(CF) …