Ranking with Popularity Bias: User Welfare under Self-Amplification Dynamics

Guy Tennenholtz, Martin Mladenov, Nadav Merlis, Craig Boutilier

Abstract

While popularity bias is recognized to play a role in recommender (and other ranking-based) systems, detailed analyses of its impact on user welfare have largely been lacking. We propose a general mechanism by which item popularity, item quality, and position bias can impact user choice, and how it can negatively impact the collective user utility of various recommender policies. Formulating the problem as a non-stationary contextual bandit, we highlight the importance of exploration, not to eliminate popularity bias, but to mitigate its negative effects. First, naive popularity-biased recommenders are shown to induce linear regret by conflating item quality and popularity. More generally, we show that, even in linear settings, identifiability of item quality may not be possible due to the confounding effects of popularity bias. However, under sufficient variability assumptions, we develop an efficient UCB-style algorithm and prove efficient regret guarantees. We complement our analysis with several simulation studies.

Introduction

In the world of recommender systems, a "rich-get-richer" phenomenon often dominates: items gain popularity not necessarily due to superior quality, but because they are already popular. This self-amplifying feedback loop, known as popularity bias, can lead algorithms to promote low-quality content simply because it was trending early on. This research explores how these dynamics impact user welfare and proposes a method to disentangle quality from popularity.

The Confounding of Choice

User choice in a ranking system is typically influenced by three main factors:

  1. Item Quality: The intrinsic merit of the item.
  2. Position Bias: The tendency to click higher-ranked items regardless of merit.
  3. Popularity Bias: The tendency to choose items that are already widely consumed.

The core challenge is that these factors are confounded. When a user selects a popular item at the top of a list, the system cannot easily determine if the choice was driven by quality or bias. This creates a non-stationary environment where the act of recommendation alters future popularity, potentially trapping the system in a suboptimal state.

The "Unlucky Draw" and Identifiability

A key insight of the paper is the "Impossibility Theorem," which states that without specific assumptions, a ranker cannot distinguish between a high-quality item and a low-quality item that received an early popularity boost. This leads to the "Unlucky Draw" scenario, where a mediocre item dominates the rankings indefinitely because it was selected early on.

Asymptotic rank degree showing how early 'unlucky' or 'lucky' draws can lead to different long-term item promotion levels, illustrating the self-amplifying nature of popularity bias.

The Quality-Popularity (QP) Ranker

To address these challenges, the authors introduce the Quality-Popularity (QP) Ranker. This algorithm is modeled as a non-stationary contextual bandit that uses an Upper Confidence Bound (UCB) approach.

  • Decoupling Biases: The QP Ranker explicitly maintains separate estimates for quality and popularity parameters.
  • Strategic Exploration: It leverages a "diversity" assumption—the idea that different user contexts allow items to be observed under varying conditions, helping the algorithm eventually "decouple" the biases.
  • Saturation-Awareness: The ranker continues to explore until item popularity effects are sufficiently understood (saturated), preventing premature convergence on mediocre items.

Key Results

Simulation studies demonstrate that the QP Ranker achieves sublinear regret, meaning it eventually learns to maximize user satisfaction over time. In contrast, "greedy" or "popularity-oblivious" rankers often suffer from linear regret, failing to ever identify the best items due to the feedback loop.

Comparison of regret over time for the QP Ranker versus baseline algorithms. The QP Ranker (blue) achieves sublinear regret, while baselines show linear growth, indicating a permanent failure to optimize user welfare.

The QP Ranker significantly outperforms baselines by successfully identifying and promoting the highest-quality items, even when they start with low popularity. This ensures that long-term social welfare is maximized rather than just following temporary trends.

Conclusion

This work provides a rigorous foundation for understanding and mitigating popularity bias. By treating recommendation as a non-stationary bandit problem and employing strategic exploration, we can build systems that prioritize true item quality over temporary hype. Future work will explore non-linear interactions between quality and popularity and the simultaneous learning of position bias.

Summary updated

Abstract

While popularity bias is recognized to play a role in recommmender (and other ranking-based) systems, detailed analyses of its impact on user welfare have largely been lacking. We propose a general mechanism by which item popularity, item quality, and position bias can impact user choice, and how it can negatively impact the collective user utility of various recommender policies. Formulating the problem as a non-stationary contextual bandit, we highlight the importance of exploration, not to eliminate popularity bias, but to mitigate its negative effects. First, naive popularity-biased recommenders are shown to induce linear regret by conflating item quality and popularity. More generally, we show that, even in linear settings, identifiability of item quality may not be possible due to the confounding effects of popularity bias. However, under sufficient variability assumptions, we develop an efficient UCB-style algorithm and prove efficient regret guarantees. We complement our analysis with several simulation studies.
BibTeX
@misc{tennenholtz2023ranking,
  author = {Guy Tennenholtz and Martin Mladenov and Nadav Merlis and Craig Boutilier},
  title = {{Ranking with Popularity Bias: User Welfare under Self-Amplification Dynamics}},
  year = {2023},
  eprint = {2305.18333},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2305.18333},
}
Figure