Stay or Stray - A Dynamical Systems Viewpoint of Popularity Bias

• URL: http://arxiv.org/abs/2608.10474v1
• Date: Tue, 11 Aug 2026 04:41:24 GMT
• Title: Stay or Stray - A Dynamical Systems Viewpoint of Popularity Bias
• Abstract summary: Popularity bias in recommendation systems arises when a majority user class generates disproportionate interaction data.<n>We study the coupled evolution of recommender model updates and user engagement through the lens of dynamical systems.<n>We derive conditions under which popularity bias is provably emergent, as well as conditions under which symmetric retention of all user classes is possible.
• Score: 20.28314553793501
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Popularity bias in recommendation systems arises when a majority user class generates disproportionate interaction data, causing the system to increasingly favour it while degrading recommendation quality for niche users. While extensive empirical evidence of popularity bias exists, the dynamics leading to its emergence are not well understood. In this work, we study the coupled evolution of recommender model updates and user engagement through the lens of dynamical systems. We formulate a stochastic process and analyse its asymptotic behaviour through an ordinary differential equation (ODE) framework grounded in two-time-scale stochastic approximation. We characterise the equilibrium points of this dynamical system, and derive conditions under which popularity bias is provably emergent, as well as conditions under which symmetric retention of all user classes is possible. We conduct experiments on synthetic data and real-world production logs derived from a large-scale commercial music recommendation platform to validate our theoretical results.

Related papers

• Probabilistic Residual Learning for Online Recommendations [50.32543279885484]
  Probabilistic Residual Learning (PRL) is a causal Bayesian recommendation model that groups users for localized residual modeling.<n>PRL is compatible with various base deep learning recommender systems, improving their performance while automatically discovering meaningful user clusters.
  arXiv  Detail & Related papers  (2026-07-23T02:39:12Z)
• The Diversity Paradox revisited: Systemic Effects of Feedback Loops in Recommender Systems [1.6167794587866464]
  We propose a feedback-loop model that captures implicit feedback, periodic retraining, and probabilistic adoption of recommendations.<n>We apply the framework on online retail and music streaming data and analyze systemic effects of the feedback loop.<n>Our results highlight the need to move beyond static evaluations and account explicitly for feedback-loop dynamics when designing recommender systems.
  arXiv  Detail & Related papers  (2026-02-18T09:52:52Z)
• How Sampling Shapes LLM Alignment: From One-Shot Optima to Iterative Dynamics [65.67654005892469]
  We show that proper instance-dependent sampling can yield stronger ranking guarantees, while skewed on-policy sampling can induce excessive concentration under structured preferences.<n>We then analyze iterative alignment dynamics in which the learned policy feeds back into future sampling and reference policies.<n>Our theoretical insights extend to Direct Preference Optimization, indicating the phenomena we captured are common to a broader class of preference-alignment methods.
  arXiv  Detail & Related papers  (2026-02-12T17:11:08Z)
• Modeling Bias Evolution in Fashion Recommender Systems: A System Dynamics Approach [0.0]
  Bias in recommender systems not only distorts user experience but also perpetuates and amplifies existing societal stereotypes.<n>This study employs a dynamic modeling approach to scrutinize the mechanisms of bias activation and reinforcement within Fashion Recommender Systems.
  arXiv  Detail & Related papers  (2025-09-27T20:16:29Z)
• STARec: An Efficient Agent Framework for Recommender Systems via Autonomous Deliberate Reasoning [54.28691219536054]
  We introduce STARec, a slow-thinking augmented agent framework that endows recommender systems with autonomous deliberative reasoning capabilities.<n>We develop anchored reinforcement training - a two-stage paradigm combining structured knowledge distillation from advanced reasoning models with preference-aligned reward shaping.<n>Experiments on MovieLens 1M and Amazon CDs benchmarks demonstrate that STARec achieves substantial performance gains compared with state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-08-26T08:47:58Z)
• Response Theory via Generative Score Modeling [0.0]
  We introduce an approach for analyzing the responses of dynamical systems to external perturbations that combines score-based generative modeling with the Generalized Fluctuation-Dissipation Theorem (GFDT) The methodology enables accurate estimation of system responses, including those with non-Gaussian statistics.
  arXiv  Detail & Related papers  (2024-02-01T21:38:10Z)
• Ensuring User-side Fairness in Dynamic Recommender Systems [37.20838165555877]
  This paper presents the first principled study on ensuring user-side fairness in dynamic recommender systems.<n>We propose FAir Dynamic rEcommender (FADE), an end-to-end fine-tuning framework to dynamically ensure user-side fairness over time.<n>We show that FADE effectively and efficiently reduces performance disparities with little sacrifice in the overall recommendation performance.
  arXiv  Detail & Related papers  (2023-08-29T22:03:17Z)
• Counterfactual Augmentation for Multimodal Learning Under Presentation Bias [48.372326930638025]
  In machine learning systems, feedback loops between users and models can bias future user behavior, inducing a presentation bias in labels. We propose counterfactual augmentation, a novel causal method for correcting presentation bias using generated counterfactual labels.
  arXiv  Detail & Related papers  (2023-05-23T14:09:47Z)
• Unbiased Learning to Rank with Biased Continuous Feedback [5.561943356123711]
  Unbiased learning-to-rank(LTR) algorithms are verified to model the relative relevance accurately based on noisy feedback. To provide personalized high-quality recommendation results, recommender systems need model both categorical and continuous biased feedback. We introduce the pairwise trust bias to separate the position bias, trust bias, and user relevance explicitly. Experiment results on public benchmark datasets and internal live traffic of a large-scale recommender system at Tencent News show superior results for continuous labels.
  arXiv  Detail & Related papers  (2023-03-08T02:14:08Z)
• Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
  Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform. Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online. Intent modeling is thus critical for understanding users and optimizing long-term user experience.
  arXiv  Detail & Related papers  (2022-11-17T19:00:24Z)
• Investigating Bias with a Synthetic Data Generator: Empirical Evidence and Philosophical Interpretation [66.64736150040093]
  Machine learning applications are becoming increasingly pervasive in our society. Risk is that they will systematically spread the bias embedded in data. We propose to analyze biases by introducing a framework for generating synthetic data with specific types of bias and their combinations.
  arXiv  Detail & Related papers  (2022-09-13T11:18:50Z)
• Unbiased Pairwise Learning to Rank in Recommender Systems [4.058828240864671]
  Unbiased learning to rank algorithms are appealing candidates and have already been applied in many applications with single categorical labels. We propose a novel unbiased LTR algorithm to tackle the challenges, which innovatively models position bias in the pairwise fashion. Experiment results on public benchmark datasets and internal live traffic show the superior results of the proposed method for both categorical and continuous labels.
  arXiv  Detail & Related papers  (2021-11-25T06:04:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.