Addressing Personalized Bias for Unbiased Learning to Rank

📅 2025-08-28
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
Existing unbiased learning to rank (ULTR) methods assume user behavior logs originate from a homogeneous “average user,” ignoring heterogeneity in query intent and document browsing preferences across individuals—introducing bias. Method: This paper formally introduces the user-aware ULTR problem, modeling personalized biases in user–query–document ternary interactions. Leveraging causal inference, we propose a low-variance user-aware inverse propensity scoring (IPS) estimator that jointly models user behavior distributions and aggregates query-level weights. Contribution/Results: Evaluated on two semi-synthetic and one real-world dataset, our method significantly outperforms state-of-the-art ULTR baselines in ranking accuracy while improving fairness. It establishes a novel paradigm for unbiased learning under personalization, bridging the gap between traditional ULTR and user-specific behavioral modeling.

Technology Category

Application Category

📝 Abstract
Unbiased learning to rank (ULTR), which aims to learn unbiased ranking models from biased user behavior logs, plays an important role in Web search. Previous research on ULTR has studied a variety of biases in users' clicks, such as position bias, presentation bias, and outlier bias. However, existing work often assumes that the behavior logs are collected from an ``average'' user, neglecting the differences between different users in their search and browsing behaviors. In this paper, we introduce personalized factors into the ULTR framework, which we term the user-aware ULTR problem. Through a formal causal analysis of this problem, we demonstrate that existing user-oblivious methods are biased when different users have different preferences over queries and personalized propensities of examining documents. To address such a personalized bias, we propose a novel user-aware inverse-propensity-score estimator for learning-to-rank objectives. Specifically, our approach models the distribution of user browsing behaviors for each query and aggregates user-weighted examination probabilities to determine propensities. We theoretically prove that the user-aware estimator is unbiased under some mild assumptions and shows lower variance compared to the straightforward way of calculating a user-dependent propensity for each impression. Finally, we empirically verify the effectiveness of our user-aware estimator by conducting extensive experiments on two semi-synthetic datasets and a real-world dataset.
Problem

Research questions and friction points this paper is trying to address.

Addressing personalized bias in unbiased learning to rank
Modeling user-specific browsing behaviors for each query
Developing user-aware inverse-propensity-score estimator for ranking
Innovation

Methods, ideas, or system contributions that make the work stand out.

User-aware inverse-propensity-score estimator for ranking
Models user browsing distributions per query
Aggregates user-weighted examination probabilities
🔎 Similar Papers
No similar papers found.
Z
Zechun Niu
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China
L
Lang Mei
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China
L
Liu Yang
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China
Ziyuan Zhao
Ziyuan Zhao
Harvard University
Qiang Yan
Qiang Yan
Singapore Management University
Jiaxin Mao
Jiaxin Mao
Renmin University of China
Information RetrievalUser Behavior AnalysisData Mining and Machine Learning
Ji-Rong Wen
Ji-Rong Wen
Gaoling School of Artificial Intelligence, Renmin University of China
Large Language ModelWeb SearchInformation RetrievalMachine Learning