On User-side Fairness in Negative Sampling for Recommender Systems

• URL: http://arxiv.org/abs/2304.07487v2
• Date: Fri, 20 Dec 2024 03:51:41 GMT
• Title: On User-side Fairness in Negative Sampling for Recommender Systems
• Authors: Yueqing Xuan, Kacper Sokol, Mark Sanderson, Jeffrey Chan,
• Abstract summary: We show that active users receive more accurate recommendation than inactive users for state-of-the-art negative sampling strategies. We propose a group-wise negative ratio setup where we use the appropriate smaller negative ratio for inactive users and a bigger ratio for active users.
• Score: 26.57812122315108
• License:
• Abstract: Recommender systems are usually trained to discern between positive and negative instances for each user. Negative sampling plays an important role in selecting informative negative items. Since positive data is disproportionately contributed by a minority of active users, negative samplers might be affected by data imbalance thus choosing more informative negative items for active users. Consequently, users with low participation are further underrepresented in the training data, potentially causing subpar treatment from recommenders. In this paper we demonstrate empirically that active users receive more accurate recommendation than inactive users for state-of-the-art negative sampling strategies, and the degree of data imbalance influences the severity of performance disparities. We further show that the performance gain brought by sampling more negative instances for each positive item is unequally distributed across user groups. Generally, active users benefit from performance gain whereas inactive users might suffer from performance degradation. To address these shortcomings, we propose a group-wise negative ratio setup where we use the appropriate smaller negative ratio for inactive users and a bigger ratio for active users. Comprehensive experiments show our proposed group-wise ratio outperforms a single global ratio in user-side fairness and performance improvement.

Related papers

• Contrastive Learning with Negative Sampling Correction [52.990001829393506]
  We propose a novel contrastive learning method named Positive-Unlabeled Contrastive Learning (PUCL) PUCL treats the generated negative samples as unlabeled samples and uses information from positive samples to correct bias in contrastive loss. PUCL can be applied to general contrastive learning problems and outperforms state-of-the-art methods on various image and graph classification tasks.
  arXiv  Detail & Related papers  (2024-01-13T11:18:18Z)
• DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loops [41.21024436158042]
  We study the negative impact of feedback loops and unknown exposure mechanisms on recommendation quality and user experience. We propose Dynamic Personalized Ranking (textbfDPR), an unbiased algorithm that uses dynamic re-weighting to mitigate the cross-effects. We show theoretically that our approach mitigates the negative effects of feedback loops and unknown exposure mechanisms.
  arXiv  Detail & Related papers  (2023-11-10T04:36:00Z)
• Learning from Negative User Feedback and Measuring Responsiveness for Sequential Recommenders [13.762960304406016]
  We introduce explicit and implicit negative user feedback into the training objective of sequential recommenders. We demonstrate the effectiveness of this approach using live experiments on a large-scale industrial recommender system.
  arXiv  Detail & Related papers  (2023-08-23T17:16:07Z)
• Personalizing Intervened Network for Long-tailed Sequential User Behavior Modeling [66.02953670238647]
  Tail users suffer from significantly lower-quality recommendation than the head users after joint training. A model trained on tail users separately still achieve inferior results due to limited data. We propose a novel approach that significantly improves the recommendation performance of the tail users.
  arXiv  Detail & Related papers  (2022-08-19T02:50:19Z)
• Generating Negative Samples for Sequential Recommendation [83.60655196391855]
  We propose to Generate Negative Samples (items) for Sequential Recommendation (SR) A negative item is sampled at each time step based on the current SR model's learned user preferences toward items. Experiments on four public datasets verify the importance of providing high-quality negative samples for SR.
  arXiv  Detail & Related papers  (2022-08-07T05:44:13Z)
• FedCL: Federated Contrastive Learning for Privacy-Preserving Recommendation [98.5705258907774]
  FedCL can exploit high-quality negative samples for effective model training with privacy well protected. We first infer user embeddings from local user data through the local model on each client, and then perturb them with local differential privacy (LDP) Since individual user embedding contains heavy noise due to LDP, we propose to cluster user embeddings on the server to mitigate the influence of noise.
  arXiv  Detail & Related papers  (2022-04-21T02:37:10Z)
• Rethinking InfoNCE: How Many Negative Samples Do You Need? [54.146208195806636]
  We study how many negative samples are optimal for InfoNCE in different scenarios via a semi-quantitative theoretical framework. We estimate the optimal negative sampling ratio using the $K$ value that maximizes the training effectiveness function.
  arXiv  Detail & Related papers  (2021-05-27T08:38:29Z)
• User-oriented Fairness in Recommendation [21.651482297198687]
  We address the unfairness problem in recommender systems from the user perspective. We group users into advantaged and disadvantaged groups according to their level of activity. Our approach can not only improve group fairness of users in recommender systems, but also achieve better overall recommendation performance.
  arXiv  Detail & Related papers  (2021-04-21T17:50:31Z)
• Fairness-Aware Explainable Recommendation over Knowledge Graphs [73.81994676695346]
  We analyze different groups of users according to their level of activity, and find that bias exists in recommendation performance between different groups. We show that inactive users may be more susceptible to receiving unsatisfactory recommendations, due to insufficient training data for the inactive users. We propose a fairness constrained approach via re-ranking to mitigate this problem in the context of explainable recommendation over knowledge graphs.
  arXiv  Detail & Related papers  (2020-06-03T05:04:38Z)

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.