The Stereotyping Problem in Collaboratively Filtered Recommender Systems

• URL: http://arxiv.org/abs/2106.12622v1
• Date: Wed, 23 Jun 2021 18:37:47 GMT
• Title: The Stereotyping Problem in Collaboratively Filtered Recommender Systems
• Authors: Wenshuo Guo, Karl Krauth, Michael I. Jordan, Nikhil Garg
• Abstract summary: We show that matrix factorization-based collaborative filtering algorithms induce a kind of stereotyping. If preferences for a textitset of items are anti-correlated in the general user population, then those items may not be recommended together to a user. We propose an alternative modelling fix, which is designed to capture the diverse multiple interests of each user.
• Score: 77.56225819389773
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender systems -- and especially matrix factorization-based collaborative filtering algorithms -- play a crucial role in mediating our access to online information. We show that such algorithms induce a particular kind of stereotyping: if preferences for a \textit{set} of items are anti-correlated in the general user population, then those items may not be recommended together to a user, regardless of that user's preferences and ratings history. First, we introduce a notion of \textit{joint accessibility}, which measures the extent to which a set of items can jointly be accessed by users. We then study joint accessibility under the standard factorization-based collaborative filtering framework, and provide theoretical necessary and sufficient conditions when joint accessibility is violated. Moreover, we show that these conditions can easily be violated when the users are represented by a single feature vector. To improve joint accessibility, we further propose an alternative modelling fix, which is designed to capture the diverse multiple interests of each user using a multi-vector representation. We conduct extensive experiments on real and simulated datasets, demonstrating the stereotyping problem with standard single-vector matrix factorization models.

Related papers

• ECORS: An Ensembled Clustering Approach to Eradicate The Local And Global Outlier In Collaborative Filtering Recommender System [0.0]
  outlier detection is a key research area in recommender systems. We propose an approach that addresses these challenges by employing various clustering algorithms. Our experimental results demonstrate that this approach significantly improves the accuracy of outlier detection in recommender systems.
  arXiv  Detail & Related papers  (2024-10-01T05:06:07Z)
• Improved Diversity-Promoting Collaborative Metric Learning for Recommendation [127.08043409083687]
  Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems. This paper focuses on a challenging scenario where a user has multiple categories of interests. We propose a novel method called textitDiversity-Promoting Collaborative Metric Learning (DPCML)
  arXiv  Detail & Related papers  (2024-09-02T07:44:48Z)
• Ada-Retrieval: An Adaptive Multi-Round Retrieval Paradigm for Sequential Recommendations [50.03560306423678]
  We propose Ada-Retrieval, an adaptive multi-round retrieval paradigm for recommender systems. Ada-Retrieval iteratively refines user representations to better capture potential candidates in the full item space.
  arXiv  Detail & Related papers  (2024-01-12T15:26:40Z)
• UIPC-MF: User-Item Prototype Connection Matrix Factorization for Explainable Collaborative Filtering [2.921387082153523]
  We propose UIPC-MF, a prototype-based matrix factorization method for explainable collaborative filtering recommendations. To enhance explainability, UIPC-MF learns connection weights that reflect the associative relations between user and item prototypes for recommendations. UIPC-MF outperforms other prototype-based baseline methods in terms of Hit Ratio and Normalized Discounted Cumulative Gain on three datasets.
  arXiv  Detail & Related papers  (2023-08-14T10:18:24Z)
• Adversarial Online Collaborative Filtering [20.931533714651376]
  We investigate the problem of online collaborative filtering under no-repetition constraints. We design and analyze an algorithm that works under biclustering assumptions on the user-item preference matrix. We show that this algorithm exhibits an optimal regret guarantee, while being fully adaptive.
  arXiv  Detail & Related papers  (2023-02-11T19:30:55Z)
• The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm [154.47590401735323]
  Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems. This paper focuses on a challenging scenario where a user has multiple categories of interests. We propose a novel method called textitDiversity-Promoting Collaborative Metric Learning (DPCML)
  arXiv  Detail & Related papers  (2022-09-30T08:02:18Z)
• Sparse-Interest Network for Sequential Recommendation [78.83064567614656]
  We propose a novel textbfSparse textbfInterest textbfNEtwork (SINE) for sequential recommendation. Our sparse-interest module can adaptively infer a sparse set of concepts for each user from the large concept pool. SINE can achieve substantial improvement over state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-02-18T11:03:48Z)
• Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach [115.76667128325361]
  Recommendation models can effectively estimate underlying user interests and predict one's future behaviors. We propose an inductive collaborative filtering framework that contains two representation models. Our model achieves promising results for recommendation on few-shot users with limited training ratings and new unseen users.
  arXiv  Detail & Related papers  (2020-07-09T14:31:25Z)

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.