mlsanityData to 7 Oct 2026

Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendation

arXiv 2601.04291 ↗First posted 7 Jan 2026cs.IR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Learning from implicit feedback has become the standard paradigm for modern recommender systems. However, this setting is fraught with the persistent challenge of false negatives, where unobserved user-item interactions are not necessarily indicative of negative preference. To address this issue, this paper introduces a novel and principled loss function, named Corrected and Weighted (CW) loss, that systematically corrects for the impact of false negatives within the training objective. Our approach integrates two key techniques. First, inspired by Positive-Unlabeled learning, we debias the negative sampling process by re-calibrating the assumed negative distribution. By theoretically approximating the true negative distribution (p-) using the observable general data distribution (p) and the positive interaction distribution (p^+), our method provides a more accurate estimate of the likelihood that a sampled unlabeled item is truly negative. Second, we introduce a dynamic re-weighting mechanism that modulates the importance of each negative instance based on the model's current prediction. This scheme encourages the model to enforce a larger ranking margin between positive items and confidently predicted (i.e., easy) negative items, while simultaneously down-weighting the penalty on uncertain negatives that have a higher probability of being false negatives. A key advantage of our approach is its elegance and efficiency; it requires no complex modifications to the data sampling process or significant computational overhead, making it readily applicable to a wide array of existing recommendation models. Extensive experiments conducted on four large-scale, sparse benchmark datasets demonstrate the superiority of our proposed loss. The results show that our method consistently and significantly outperforms a suite of state-of-the-art loss functions across multiple ranking-oriented metrics.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 34 of its 51 references that are in the map. First posted on arXiv 7 Jan 2026.

Builds on

34 of 51 references.

References · 34

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  5. 2017Neural Collaborative Filteringcited by 1,108
  6. 2015Image-based Recommendations on Styles and Substitutescited by 702
  7. 2020Self-supervised Learning: Generative or Contrastivecited by 693
  8. 2019Neural Graph Collaborative Filteringcited by 660
  9. 2020Contrastive Learning with Hard Negative Samplescited by 619
  10. 2020A Survey on Contrastive Self-supervised Learningcited by 553
  11. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  12. 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
22 more
  1. 2020Self-supervised Graph Learning for Recommendationcited by 305
  2. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  3. 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
  4. 2021Decoupled Contrastive Learningcited by 141
  5. 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
  6. 2021DORO: Distributional and Outlier Robust Optimizationcited by 54
  7. 2020On the Equivalence of Decoupled Graph Convolution Network and Label Propagationcited by 49
  8. 2024Macro Graph Neural Networks for Online Billion-Scale Recommender Systemscited by 40
  9. 2022On the Effectiveness of Sampled Softmax Loss for Item Recommendationcited by 39
  10. 2017Latent Relational Metric Learning via Memory-based Attention for Collaborative Rankingcited by 38
  11. 2020Graph Convolutional Network for Recommendation with Low-pass Collaborative Filterscited by 32
  12. 2014PU Learning for Matrix Completioncited by 30
  13. 2023Empowering Collaborative Filtering with Principled Adversarial Contrastive Losscited by 24
  14. 2023Understanding Contrastive Learning via Distributionally Robust Optimizationcited by 21
  15. 2023Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendationcited by 19
  16. 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
  17. 2023Outlier-Robust Wasserstein DROcited by 16
  18. 2020Graph Convolution Machine for Context-aware Recommender Systemcited by 13
  19. 2024Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendationcited by 9
  20. 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendationcited by 9
  21. 2025Breaking the Top-K Barrier: Advancing Top-K Ranking Metrics Optimization in Recommender Systemscited by 9
  22. 2023BSL: Understanding and Improving Softmax Loss for Recommendationcited by 5

Built on by

Not cited yet.