Improved Estimation of Ranks for Learning Item Recommenders with Negative Sampling

• URL: http://arxiv.org/abs/2410.06371v2
• Date: Thu, 10 Oct 2024 19:58:55 GMT
• Title: Improved Estimation of Ranks for Learning Item Recommenders with Negative Sampling
• Authors: Anushya Subbiah, Steffen Rendle, Vikram Aggarwal,
• Abstract summary: In recommendation systems, there has been a growth in the number of recommendable items. To lower this cost, it has become common to sample negative items. In this work, we demonstrate the benefits from correcting the bias introduced by sampling of negatives.
• Score: 4.316676800486521
• License:
• Abstract: In recommendation systems, there has been a growth in the number of recommendable items (# of movies, music, products). When the set of recommendable items is large, training and evaluation of item recommendation models becomes computationally expensive. To lower this cost, it has become common to sample negative items. However, the recommendation quality can suffer from biases introduced by traditional negative sampling mechanisms. In this work, we demonstrate the benefits from correcting the bias introduced by sampling of negatives. We first provide sampled batch version of the well-studied WARP and LambdaRank methods. Then, we present how these methods can benefit from improved ranking estimates. Finally, we evaluate the recommendation quality as a result of correcting rank estimates and demonstrate that WARP and LambdaRank can be learned efficiently with negative sampling and our proposed correction technique.

Related papers

• Correcting for Popularity Bias in Recommender Systems via Item Loss Equalization [1.7771454131646311]
  A small set of popular items dominate the recommendation results due to their high interaction rates. This phenomenon disproportionately benefits users with mainstream tastes while neglecting those with niche interests. We propose an in-processing approach to address this issue by intervening in the training process of recommendation models.
  arXiv  Detail & Related papers  (2024-10-07T08:34:18Z)
• 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)
• 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)
• Breaking Feedback Loops in Recommender Systems with Causal Inference [99.22185950608838]
  Recent work has shown that feedback loops may compromise recommendation quality and homogenize user behavior. We propose the Causal Adjustment for Feedback Loops (CAFL), an algorithm that provably breaks feedback loops using causal inference. We show that CAFL improves recommendation quality when compared to prior correction methods.
  arXiv  Detail & Related papers  (2022-07-04T17:58:39Z)
• Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
  We show how to return a set of items rigorously guaranteed to contain mostly good items. Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate. We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
  arXiv  Detail & Related papers  (2022-07-04T17:49:25Z)
• Evaluating the Predictive Performance of Positive-Unlabelled Classifiers: a brief critical review and practical recommendations for improvement [77.34726150561087]
  Positive-Unlabelled (PU) learning is a growing area of machine learning. This paper critically reviews the main PU learning evaluation approaches and the choice of predictive accuracy measures in 51 articles proposing PU classifiers.
  arXiv  Detail & Related papers  (2022-06-06T08:31:49Z)
• Negative Sampling for Recommendation [7.758275614033198]
  How to effectively sample high-quality negative instances is important for well training a recommendation model. We argue that a high-quality negative should be both textitinformativeness and textitunbiasedness
  arXiv  Detail & Related papers  (2022-04-02T09:50:19Z)
• Unbiased Learning for the Causal Effect of Recommendation [8.849159720632612]
  This paper proposes an unbiased learning framework for the causal effect of recommendation. We develop an unbiased learning method for the causal effect extension of a ranking metric.
  arXiv  Detail & Related papers  (2020-08-11T07:30:44Z)
• Addressing Class-Imbalance Problem in Personalized Ranking [47.11372043636176]
  We propose an efficient emphunderlineVital underlineNegative underlineSampler (VINS) to alleviate the class-imbalance issue for pairwise ranking model. VINS is a bias sampler with reject probability that will tend to accept a negative candidate with a larger degree weight than the given positive item.
  arXiv  Detail & Related papers  (2020-05-19T08:11:26Z)
• Reinforced Negative Sampling over Knowledge Graph for Recommendation [106.07209348727564]
  We develop a new negative sampling model, Knowledge Graph Policy Network (kgPolicy), which works as a reinforcement learning agent to explore high-quality negatives. kgPolicy navigates from the target positive interaction, adaptively receives knowledge-aware negative signals, and ultimately yields a potential negative item to train the recommender.
  arXiv  Detail & Related papers  (2020-03-12T12:44:30Z)

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.