A Probabilistic Position Bias Model for Short-Video Recommendation Feeds
Not on the map. Why?
Abstract (arXiv)
Modern web-based platforms show ranked lists of recommendations to users, attempting to maximise user satisfaction or business metrics. Typically, the goal of such systems boils down to maximising the exposure probability for items that are deemed "reward-maximising" according to a metric of interest. This general framing comprises streaming applications, as well as e-commerce or job recommendations, and even web search. Position bias or user models can be used to estimate exposure probabilities for each use-case, specifically tailored to how users interact with the presented rankings. A unifying factor in these diverse problem settings is that typically only one or several items will be engaged with (clicked, streamed,...) before a user leaves the ranked list. Short-video feeds on social media platforms diverge from this general framing in several ways, most notably that users do not tend to leave the feed after e.g. liking a post. Indeed, seemingly infinite feeds invite users to scroll further down the ranked list. For this reason, existing position bias or user models tend to fall short in such settings, as they do not accurately capture users' interaction modalities. In this work, we propose a novel and probabilistically sound personalised position bias model for feed recommendations. We focus on a 1st-level feed in a hierarchical structure, where users may enter a 2nd-level feed via any given 1st-level item. We posit that users come to the platform with a scrolling budget drawn according to some distribution, and show how the survival function of said distribution can be used to obtain closed-form estimates for personalised exposure probabilities. Empirical insights from a large-scale social media platform show how our probabilistic position bias model more accurately captures empirical exposure than existing models, and paves the way for unbiased evaluation and learning-to-rank.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jul 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 4.
7 papers.
- 2023On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n Recommendationcited by 13
- 2023Ad-load Balancing via Off-policy Learning in a Content Marketplacecited by 11
- 2025Interactive Recommendation Agent with Active User Commandscited by 10
- 2023Offline Recommender System Evaluation under Unobserved Confoundingcited by 4
- 2025Counterfactual Inference under Thompson Samplingcited by 0
- 2025Meta Off-Policy Estimationcited by 0
- 2025Modeling Bias Evolution in Fashion Recommender Systems: A System Dynamics Approachcited by 0
- 2025Modeling Bias Evolution in Fashion Recommender Systems: A System Dynamics Approach27 Sep 2025
- 2025Interactive Recommendation Agent with Active User Commands25 Sep 2025
- 2025Meta Off-Policy Estimation11 Aug 2025
- 2025Counterfactual Inference under Thompson Sampling3 Apr 2025
- 2023Ad-load Balancing via Off-policy Learning in a Content Marketplace19 Sep 2023
- 2023Offline Recommender System Evaluation under Unobserved Confounding8 Sep 2023
- 2023On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n Recommendation27 Jul 2023