Skip to content
Book Open access

Debiased Recommendation Beyond the Positive Propensity Assumption

Jul 2026 · Annual International ACM SIGIR Conference on Research and Development in Information Retrieval · pp. 2061-2071 · 1 citation · 69 references
Computer Science

TL;DR

This study theoretically shows that when zero-propensity samples exist, both IPS and DR estimators become biased, and proposes ExtraDebias method, which enables debiased recommendation in both non-extrapolation and extrapolation samples.

Abstract

Post-click conversion rate (CVR) prediction is a central task in recommender systems, yet selection bias creates a severe distributional gap between the clicked training samples and the entire inference space. To address selection bias, propensity-based methods such as inverse propensity scoring (IPS) and doubly robust (DR) have been adopted, which aim to estimate the unbiased learning objective from biased training samples. However, these approaches assume strictly positive propensities, implying every user-item pair has a nonzero probability of interaction. In practice, such positivity assumption maybe violated, for example, in food-delivery platforms, some restaurants located more than 10 kilometers away will be blocked for recommendation. In this study, we theoretically show that when such zero-propensity samples, termed extrapolation samples exist, both IPS and DR estimators become biased. To overcome this limitation, we propose ExtraDebias method, which enables debiased recommendation in both non-extrapolation and extrapolation samples. Specifically, we first train a propensity model to identify extrapolation samples with extremely small propensity estimates, then estimate their pseudo-label intervals, and derive an upper bound of the learning objective for extrapolation samples. By minimizing the derived upper bound, debiased learning on extrapolation samples is ensured, while unbiased learning on non-extrapolation samples is achieved by standard IPS. Experiments on four real-world offline datasets and one online A/B test show that ExtraDebias effectively minimizes prediction errors on extrapolation samples and achieves optimal performance.

Read PDF

Similar papers

Preprint Sep 2026

Mitigating Popularity Bias in Recommendation with Global Listwise Learning and Progressive Bi-Weighting

In recommender systems, user feedback typically follows a long-tail distribution, which leads many recommendation algorithms to exacerbate popularity bias by disproportionately favoring popular items. To mitigate this issue, recent studies have employed Inverse Propensity Scoring (IPS) to rebalance training data via re...

Tian-Yu Zhu, Jian-Dong Ding, Yan-Song Shi et al. · 0 citations
#machine learning Preprint Aug 2026

MERIT: Mitigating Exposure Bias in Generative XMC for User-Interest Propensity Modeling

Matching users to interest categories at scale is central to personalized shopping, but the task is challenging in large e-commerce platforms, where label spaces continually evolve and user-interest signals are sparse and long-tailed. Autoregressive language models are appealing because their world knowledge and semant...

Abhinav Mahajan, Arindam Sarkar, P. Comar · 0 citations
Open access Aug 2026

IMPROVING LONG-TAIL RECOMMENDATION VIA ROULETTE WHEEL SELECTION USING HYBRID RATING AND TEMPORAL DECAY WEIGHTING

The phenomenon of information overload on digital platforms frequently leads to a skewed long-tail distribution, where user interactions concentrate on popular items while the majority remains undiscovered. This popularity bias is particularly acute in the book domain, where metaphorical titles defy traditional lexical...

Andy Maulana Yusuf, Miftah Farid Adiwisastra, Faizal Riza et al. · 0 citations
Sep 2026

ScoreRec: Reallocating Probability Mass in Sequential Recommendation via Score-based Diffusion Modeling

Sequential recommendation generates personalized item rankings by estimating latent user-preference distributions from historical interactions. Although Diffusion Models (DMs) have gained prominence due to their exceptional capacity to capture complex distributions, current DM-based recommenders exhibit a critical limi...

Peng He, Yao Liu, Tong Luo et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Optimal Design for Active Preference Learning with Biased LLM Judges

Learning from human preferences is central to large language model (LLM) alignment, but human preference annotation is costly. Active preference learning reduces this cost by selecting informative comparisons, and LLM judges can provide additional scalable feedback. However, the preferences of the judges may deviate fr...

Zhong-Man Du, Hui-Ming Zhang, Hao-Dong Zhu et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.