arXiv Machine Learning By Sarvesh Shashidhar, Lankireddy Prabhat, Arpit Agarwal, D. Manjunath, Karan Bhukar, Tanmay Khandelwal

Stay or Stray - A Dynamical Systems Viewpoint of Popularity Bias

Read the original on arXiv Machine Learning →

arXiv:2608. 10474v1 Announce Type: cross 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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 9

The Value of Personalized Recommendations: Evidence from Netflix

arXiv:2511. 07280v5 Announce Type: replace-cross Abstract: Personalized recommendation systems shape much of user choice online, yet their targeted nature makes separating out the value of recommendation and the underlying goods challenging.

By Kevin Zielnicki, Guy Aridor, Aur\'elien Bibaut, Allen Tran, Winston Chou, Nathan Kallus
arXiv AI
4d ago

FairDiff: Mitigating the Self-Reinforcing Matthew Effect in Diffusion Recommender Models

FairDiff is a new fairness‑aware diffusion framework designed to mitigate the self‑reinforcing Matthew Effect in Diffusion Recommender Models (DRMs). It introduces Popularity Condition Guidance (PCG) to reweight inference‑time gradients and penalize high‑popularity items, and a Semantic Calibration (SC) module that aligns forward and reverse distributions via optimal transport. Experiments show FairDiff achieves state‑of‑the‑art performance while reducing popularity bias in DRMs.

By Song-Li Wu, Xianquan Wang, Zhaocheng Du, Weinan Gan, Jingyi Wang
arXiv AI
6d ago

SPADE: Escaping the Popularity-Similarity Frontier to Measure Serendipitous Recommendations

SPADE (Serendipitous Pareto Distance Evaluation) is a new metric for recommender systems that simultaneously considers item similarity, popularity, and user relevance. It projects items into a two‑dimensional space and computes a user‑specific Pareto frontier of maximally popular and historically similar items, then averages the minimum Euclidean distance from this frontier for correctly recommended test‑set items. Experiments on five datasets and five baseline algorithms demonstrate that SPADE effectively discourages algorithms from exploiting accuracy‑only metrics and reliably isolates serendipitous discoveries.

By Tobias Vente, Maarten Peirsman, Noah Dani\"els, Hannu Toivonen, Bart Goethals