The paper introduces a counterfactual observability framework for Netflix’s recommender systems, aiming to disentangle raw engagement signals—such as views and clicks—from confounding factors like content quality, model behavior, presentation bias, and audience reach. It proposes three stakeholder‑centered principles and measurement methods that reduce bias, assess relativity, and capture incrementality, applicable to both single‑stage and cascading recommender architectures. The framework is demonstrated through multiple production deployments, showing its effectiveness in enhancing observability across Netflix’s recommendation pipelines.
By Chaoran Guo, Ding Tong, Ting-Po Lee, Scarlet Chen
arXiv:2403. 00802v2 Announce Type: replace-cross Abstract: Production-grade recommender systems rely heavily on a large-scale corpus used by online media services, including Netflix, Pinterest, and Amazon.
By Amit Kumar Jaiswal
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.
By Sarvesh Shashidhar, Lankireddy Prabhat, Arpit Agarwal, D. Manjunath, Karan Bhukar, Tanmay Khandelwal
arXiv:2412. 20802v3 Announce Type: replace-cross Abstract: Recommender systems are widely used in the digital landscape to match users with content fitting their preferences.
By Aurore Archimbaud, Andreas Alfons, Ines Wilms
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
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