mlsanityData to 7 Oct 2026

Simplify and Robustify Negative Sampling for Implicit Collaborative Filtering

arXiv 2009.03376 ↗First posted 7 Sep 2020cs.LG cs.IRcited by 34

Not on the map. Why?

Abstract (arXiv)

Negative sampling approaches are prevalent in implicit collaborative filtering for obtaining negative labels from massive unlabeled data. As two major concerns in negative sampling, efficiency and effectiveness are still not fully achieved by recent works that use complicate structures and overlook risk of false negative instances. In this paper, we first provide a novel understanding of negative instances by empirically observing that only a few instances are potentially important for model learning, and false negatives tend to have stable predictions over many training iterations. Above findings motivate us to simplify the model by sampling from designed memory that only stores a few important candidates and, more importantly, tackle the untouched false negative problem by favouring high-variance samples stored in memory, which achieves efficient sampling of true negatives with high-quality. Empirical results on two synthetic datasets and three real-world datasets demonstrate both robustness and superiorities of our negative sampling method.

Key facts. Cited by 34 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 10; 2024: 11; 2025: 5; 2026: 2.

34 papers.

Sort:

  1. 2021Unsupervised Path Representation Learning with Curriculum Negative Samplingcited by 42
  2. 2024Double Correction Framework for Denoising Recommendationcited by 19
  3. 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
  4. 2024Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogscited by 15
  5. 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applicationscited by 14
  6. 2023Distillation from Heterogeneous Models for Top-K Recommendationcited by 13
  7. 2024End-to-end Training for Recommendation with Language-based User Profilescited by 10
  8. 2024Diffusion-based Negative Sampling on Graphs for Link Predictioncited by 9
  9. 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenderscited by 9
  10. 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
  11. 2021Learning Explicit User Interest Boundary for Recommendationcited by 6
  12. 2022Consensus Learning from Heterogeneous Objectives for One-Class Collaborative Filteringcited by 5
22 more
  1. 2023Neighborhood-based Hard Negative Mining for Sequential Recommendationcited by 5
  2. 2023Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)cited by 5
  3. 2024SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendationcited by 4
  4. 2025Beyond Single Labels: Improving Conversational Recommendation through LLM-Powered Data Augmentationcited by 4
  5. 2024Large Language Model Enhanced Hard Sample Identification for Denoising Recommendationcited by 3
  6. 2023Dimension Independent Mixup for Hard Negative Sample in Collaborative Filteringcited by 2
  7. 2024Knowledge Distillation Approaches for Accurate and Efficient Recommender Systemcited by 2
  8. 2022Bayesian Negative Sampling for Recommendationcited by 1
  9. 2023Graph-Based Model-Agnostic Data Subsampling for Recommendation Systemscited by 1
  10. 2023Representer Point Selection for Explaining Regularized High-dimensional Modelscited by 1
  11. 2024Curriculum Negative Mining For Temporal Networkscited by 1
  12. 2025BehaveGPT: A Foundation Model for Large-scale User Behavior Modelingcited by 1
  13. 2021Scalable Personalised Item Ranking through Parametric Density Estimationcited by 0
  14. 2022One-class Recommendation Systems with the Hinge Pairwise Distance Loss and Orthogonal Representationscited by 0
  15. 2023DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loopscited by 0
  16. 2023(Debiased) Contrastive Learning Loss for Recommendation (Technical Report)cited by 0
  17. 2024Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivitycited by 0
  18. 2025MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendationcited by 0
  19. 2025Large language model as user daily behavior data generator: balancing population diversity and individual personalitycited by 0
  20. 2025Hard vs. Noise: Resolving Hard-Noisy Sample Confusion in Recommender Systems via Large Language Modelscited by 0
  21. 2026Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendationcited by 0
  22. 2026Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrievalcited by 0