Bias and debias in recommender system: A survey and future directions

J Chen, H Dong, X Wang, F Feng, M Wang… - ACM Transactions on …, 2023 - dl.acm.org
While recent years have witnessed a rapid growth of research papers on recommender
system (RS), most of the papers focus on inventing machine learning models to better fit …

Algorithmic Fairness: A Tolerance Perspective

R Luo, T Tang, F **a, J Liu, C Xu, LY Zhang… - arxiv preprint arxiv …, 2024 - arxiv.org
Recent advancements in machine learning and deep learning have brought algorithmic
fairness into sharp focus, illuminating concerns over discriminatory decision making that …

Cross-positional attention for debiasing clicks

H Zhuang, Z Qin, X Wang, M Bendersky… - Proceedings of the Web …, 2021 - dl.acm.org
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 …

Unbiased learning-to-rank needs unconfounded propensity estimation

D Luo, L Zou, Q Ai, Z Chen, C Li, D Yin… - Proceedings of the 47th …, 2024 - dl.acm.org
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 …

Doubly robust estimation for correcting position bias in click feedback for unbiased learning to rank

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 …

Dual unbiased recommender learning for implicit feedback

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 …

Reaching the end of unbiasedness: Uncovering implicit limitations of click-based learning to rank

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 …

Towards disentangling relevance and bias in unbiased learning to rank

Y Zhang, L Yan, Z Qin, H Zhuang, J Shen… - Proceedings of the 29th …, 2023 - dl.acm.org
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 …

Unified off-policy learning to rank: a reinforcement learning perspective

Z Zhang, Y Su, H Yuan, Y Wu… - Advances in …, 2023 - 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 …

Revisiting two-tower models for unbiased learning to rank

L Yan, Z Qin, H Zhuang, X Wang, M Bendersky… - Proceedings of the 45th …, 2022 - dl.acm.org
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 …