mlsanityData to 7 Oct 2026

Rethinking Collaborative Metric Learning: Toward an Efficient Alternative without Negative Sampling

arXiv 2206.11549 ↗First posted 23 Jun 2022cs.LG cs.IRcited by 14

Not on the map. Why?

Abstract (arXiv)

The recently proposed Collaborative Metric Learning (CML) paradigm has aroused wide interest in the area of recommendation systems (RS) owing to its simplicity and effectiveness. Typically, the existing literature of CML depends largely on the textitnegative sampling strategy to alleviate the time-consuming burden of pairwise computation. However, in this work, by taking a theoretical analysis, we find that negative sampling would lead to a biased estimation of the generalization error. Specifically, we show that the sampling-based CML would introduce a bias term in the generalization bound, which is quantified by the per-user textitTotal Variance (TV) between the distribution induced by negative sampling and the ground truth distribution. This suggests that optimizing the sampling-based CML loss function does not ensure a small generalization error even with sufficiently large training data. Moreover, we show that the bias term will vanish without the negative sampling strategy. Motivated by this, we propose an efficient alternative without negative sampling for CML named textitSampling-Free Collaborative Metric Learning (SFCML), to get rid of the sampling bias in a practical sense. Finally, comprehensive experiments over seven benchmark datasets speak to the superiority of the proposed algorithm.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 31 of its 94 references that are in the map. First posted on arXiv 23 Jun 2022.

Builds on

31 of 94 references.

References · 31

  1. 2017Neural Collaborative Filteringcited by 1,108
  2. 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 733
  3. 2019Neural Graph Collaborative Filteringcited by 660
  4. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  5. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 342
  6. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  7. 2017A Survey on Network Embeddingcited by 142
  8. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  9. 2019Learning Disentangled Representations for Recommendationcited by 110
  10. 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 100
  11. 2014Collaborative Deep Learning for Recommender Systemscited by 95
  12. 2019Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferencescited by 87
19 more
  1. 2017Personalizing Session-based Recommendations with Hierarchical Recurrent Neural Networkscited by 84
  2. 2020Denoising Implicit Feedback for Recommendationcited by 80
  3. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  4. 2017On Sampling Strategies for Neural Network-based Collaborative Filteringcited by 71
  5. 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
  6. 2013One-Pass AUC Optimizationcited by 42
  7. 2018Outer Product-based Neural Collaborative Filteringcited by 41
  8. 2020Reinforced Negative Sampling over Knowledge Graph for Recommendationcited by 40
  9. 2017Latent Relational Metric Learning via Memory-based Attention for Collaborative Rankingcited by 38
  10. 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
  11. 2019Relational Collaborative Filtering:Modeling Multiple Item Relations for Recommendationcited by 23
  12. 2019Collaborative Translational Metric Learningcited by 16
  13. 2018Fast Matrix Factorization with Non-Uniform Weights on Missing Datacited by 12
  14. 2017Item Silk Road: Recommending Items from Information Domains to Social Userscited by 11
  15. 2019Improving Collaborative Metric Learning with Efficient Negative Samplingcited by 11
  16. 2019User Diverse Preference Modeling by Multimodal Attentive Metric Learningcited by 10
  17. 2017The Sample Complexity of Online One-Class Collaborative Filteringcited by 9
  18. 2018A Univariate Bound of Area Under ROCcited by 7
  19. 2020Online AUC Optimization for Sparse High-Dimensional Datasetscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 6; 2025: 4; 2026: 3.

14 papers.

Sort:

By area: