# Unbiased Collaborative Filtering with Fair Sampling

arXiv: https://arxiv.org/abs/2502.13840 · HTML: https://mlsanity.com/paper/2502.13840/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- Builds on 14 of its 33 references that are in the map.
- First posted on arXiv 19 Feb 2025.

## Builds on (most cited first, 14 of 14)

- [Causal Intervention for Leveraging Popularity Bias in Recommendation](https://mlsanity.com/paper/2105.06067/) (2021)
- [Managing Popularity Bias in Recommender Systems with Personalized Re-ranking](https://mlsanity.com/paper/1901.07555/) (2019)
- [Causal Embeddings for Recommendation](https://mlsanity.com/paper/1706.07639/) (2017)
- [Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback](https://mlsanity.com/paper/1909.03601/) (2019)
- [Modeling User Exposure in Recommendation](https://mlsanity.com/paper/1510.07025/) (2015)
- [A Survey on Popularity Bias in Recommender Systems](https://mlsanity.com/paper/2308.01118/) (2023)
- [Personalized Graph Signal Processing for Collaborative Filtering](https://mlsanity.com/paper/2302.02113/) (2023)
- [AutoSeqRec: Autoencoder for Efficient Sequential Recommendation](https://mlsanity.com/paper/2308.06878/) (2023)
- [Parameter-free Dynamic Graph Embedding for Link Prediction](https://mlsanity.com/paper/2210.08189/) (2022)
- [Triple Structural Information Modelling for Accurate, Explainable and Interactive Recommendation](https://mlsanity.com/paper/2304.11528/) (2023)
- [Cross Pairwise Ranking for Unbiased Item Recommendation](https://mlsanity.com/paper/2204.12176/) (2022)
- [Treatment Effect Estimation for User Interest Exploration on Recommender Systems](https://mlsanity.com/paper/2405.08582/) (2024)
- [Bilateral Self-unbiased Learning from Biased Implicit Feedback](https://mlsanity.com/paper/2207.12660/) (2022)
- [Unbiased Pairwise Learning from Implicit Feedback for Recommender Systems without Biased Variance Control](https://mlsanity.com/paper/2304.05066/) (2023)

## Built on by (most cited first, 6 of 6)

- [From Hidden Profiles to Governable Personalization: Recommender Systems in the Age of LLM Agents](https://mlsanity.com/paper/2604.20065/) (2026)
- [SoulSeek: Exploring the Use of Social Cues in LLM-based Information Seeking](https://mlsanity.com/paper/2601.01094/) (2026)
- [RQ-GMM: Residual Quantized Gaussian Mixture Model for Multimodal Semantic Discretization in CTR Prediction](https://mlsanity.com/paper/2602.12593/) (2026)
- [Distribution-Aware End-to-End Embedding for Streaming Numerical Features in Click-Through Rate Prediction](https://mlsanity.com/paper/2602.03223/) (2026)
- [Robust and Generalizable Safety Steering for Text-to-Image Diffusion Transformers](https://mlsanity.com/paper/2605.30049/) (2026)
- [Mood-Aware Music Recommendation: Integrating User Affective Signals into Ranking Systems](https://mlsanity.com/paper/2606.13858/) (2026)

## Abstract (arXiv)

Recommender systems leverage extensive user interaction data to model preferences; however, directly modeling these data may introduce biases that disproportionately favor popular items. In this paper, we demonstrate that popularity bias arises from the influence of propensity factors during training. Building on this insight, we propose a fair sampling (FS) method that ensures each user and each item has an equal likelihood of being selected as both positive and negative instances, thereby mitigating the influence of propensity factors. The proposed FS method does not require estimating propensity scores, thus avoiding the risk of failing to fully eliminate popularity bias caused by estimation inaccuracies. Comprehensive experiments demonstrate that the proposed FS method achieves state-of-the-art performance in both point-wise and pair-wise recommendation tasks. The code implementation is available at https://github.com/jhliu0807/Fair-Sampling.
