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 …
J Lee, S Park, J Lee - Proceedings of the 44th International ACM SIGIR …, 2021 - dl.acm.org
Unbiased recommender learning has been actively studied to alleviate the inherent bias of implicit datasets under the missing-not-at-random assumption. Existing studies solely …
A well-known challenge in leveraging implicit user feedback like clicks to improve real-world search services and recommender systems is its inherent bias. Most existing click models …
H Oosterhuis - Proceedings of the 2022 ACM SIGIR International …, 2022 - dl.acm.org
Click-based learning to rank (LTR) tackles the mismatch between click frequencies on items and their actual relevance. The approach of previous work has been to assume a model of …
Unbiased learning to rank (ULTR) studies the problem of mitigating various biases from implicit user feedback data such as clicks, and has been receiving considerable attention …
H Oosterhuis - ACM Transactions on Information Systems, 2023 - dl.acm.org
Clicks on rankings suffer from position bias: generally items on lower ranks are less likely to be examined—and thus clicked—by users, in spite of their actual preferences between …
Two-tower architecture is commonly used in real-world systems for Unbiased Learning to Rank (ULTR), where a Deep Neural Network (DNN) tower models unbiased relevance …
Z Zhang, Y Su, H Yuan, Y Wu… - Advances in …, 2024 - proceedings.neurips.cc
Abstract Off-policy Learning to Rank (LTR) aims to optimize a ranker from data collected by a deployed logging policy. However, existing off-policy learning to rank methods often make …
M Färber, M Coutinho, S Yuan - Scientometrics, 2023 - Springer
With the remarkable increase in the number of scientific entities such as publications, researchers, and scientific topics, and the associated information overload in science …