Simplify and Robustify Negative Sampling for Implicit Collaborative Filtering
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
Citing papers per year: 2021: 3; 2022: 3; 2023: 10; 2024: 11; 2025: 5; 2026: 2.
34 papers.
Sort:
- 2021Unsupervised Path Representation Learning with Curriculum Negative Samplingcited by 42
- 2024Double Correction Framework for Denoising Recommendationcited by 19
- 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
- 2024Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogscited by 15
- 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applicationscited by 14
- 2023Distillation from Heterogeneous Models for Top-K Recommendationcited by 13
- 2024End-to-end Training for Recommendation with Language-based User Profilescited by 10
- 2024Diffusion-based Negative Sampling on Graphs for Link Predictioncited by 9
- 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenderscited by 9
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
- 2021Learning Explicit User Interest Boundary for Recommendationcited by 6
- 2022Consensus Learning from Heterogeneous Objectives for One-Class Collaborative Filteringcited by 5
22 more
- 2023Neighborhood-based Hard Negative Mining for Sequential Recommendationcited by 5
- 2023Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)cited by 5
- 2024SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendationcited by 4
- 2025Beyond Single Labels: Improving Conversational Recommendation through LLM-Powered Data Augmentationcited by 4
- 2024Large Language Model Enhanced Hard Sample Identification for Denoising Recommendationcited by 3
- 2023Dimension Independent Mixup for Hard Negative Sample in Collaborative Filteringcited by 2
- 2024Knowledge Distillation Approaches for Accurate and Efficient Recommender Systemcited by 2
- 2022Bayesian Negative Sampling for Recommendationcited by 1
- 2023Graph-Based Model-Agnostic Data Subsampling for Recommendation Systemscited by 1
- 2023Representer Point Selection for Explaining Regularized High-dimensional Modelscited by 1
- 2024Curriculum Negative Mining For Temporal Networkscited by 1
- 2025BehaveGPT: A Foundation Model for Large-scale User Behavior Modelingcited by 1
- 2021Scalable Personalised Item Ranking through Parametric Density Estimationcited by 0
- 2022One-class Recommendation Systems with the Hinge Pairwise Distance Loss and Orthogonal Representationscited by 0
- 2023DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loopscited by 0
- 2023(Debiased) Contrastive Learning Loss for Recommendation (Technical Report)cited by 0
- 2024Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivitycited by 0
- 2025MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendationcited by 0
- 2025Large language model as user daily behavior data generator: balancing population diversity and individual personalitycited by 0
- 2025Hard vs. Noise: Resolving Hard-Noisy Sample Confusion in Recommender Systems via Large Language Modelscited by 0
- 2026Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendationcited by 0
- 2026Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrievalcited by 0
- 2026Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval1 Jul 2026
- 2026Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendation1 Jun 2026
- 2025Hard vs. Noise: Resolving Hard-Noisy Sample Confusion in Recommender Systems via Large Language Models10 Nov 2025
- 2025Beyond Single Labels: Improving Conversational Recommendation through LLM-Powered Data Augmentation30 Jul 2025
- 2025BehaveGPT: A Foundation Model for Large-scale User Behavior Modeling23 May 2025
- 2025Large language model as user daily behavior data generator: balancing population diversity and individual personality23 May 2025
- 2025MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendation12 Feb 2025
- 2024End-to-end Training for Recommendation with Language-based User Profiles24 Oct 2024
- 2024Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs27 Sep 2024
- 2024Large Language Model Enhanced Hard Sample Identification for Denoising Recommendation16 Sep 2024
- 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenders5 Aug 2024
- 2024Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity1 Aug 2024
22 more
- 2024Curriculum Negative Mining For Temporal Networks24 Jul 2024
- 2024Knowledge Distillation Approaches for Accurate and Efficient Recommender System19 Jul 2024
- 2024Double Correction Framework for Denoising Recommendation18 May 2024
- 2024SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation1 May 2024
- 2024Diffusion-based Negative Sampling on Graphs for Link Prediction25 Mar 2024
- 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applications27 Feb 2024
- 2023Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)13 Dec 2023
- 2023(Debiased) Contrastive Learning Loss for Recommendation (Technical Report)13 Dec 2023
- 2023DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loops10 Nov 2023
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filtering11 Aug 2023
- 2023Dimension Independent Mixup for Hard Negative Sample in Collaborative Filtering28 Jun 2023
- 2023Neighborhood-based Hard Negative Mining for Sequential Recommendation12 Jun 2023
- 2023Representer Point Selection for Explaining Regularized High-dimensional Models31 May 2023
- 2023Graph-Based Model-Agnostic Data Subsampling for Recommendation Systems25 May 2023
- 2023Distillation from Heterogeneous Models for Top-K Recommendation2 Mar 2023
- 2023On the Theories Behind Hard Negative Sampling for Recommendation7 Feb 2023
- 2022One-class Recommendation Systems with the Hinge Pairwise Distance Loss and Orthogonal Representations31 Aug 2022
- 2022Bayesian Negative Sampling for Recommendation2 Apr 2022
- 2022Consensus Learning from Heterogeneous Objectives for One-Class Collaborative Filtering26 Feb 2022
- 2021Learning Explicit User Interest Boundary for Recommendation22 Nov 2021
- 2021Unsupervised Path Representation Learning with Curriculum Negative Sampling17 Jun 2021
- 2021Scalable Personalised Item Ranking through Parametric Density Estimation11 May 2021
- 2021Unsupervised Path Representation Learning with Curriculum Negative Samplingcited by 42
- 2024Double Correction Framework for Denoising Recommendationcited by 19
- 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
- 2024Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogscited by 15
- 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applicationscited by 14
- 2023Distillation from Heterogeneous Models for Top-K Recommendationcited by 13
- 2024End-to-end Training for Recommendation with Language-based User Profilescited by 10
- 2024Diffusion-based Negative Sampling on Graphs for Link Predictioncited by 9
- 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenderscited by 9
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
- 2021Learning Explicit User Interest Boundary for Recommendationcited by 6
- 2022Consensus Learning from Heterogeneous Objectives for One-Class Collaborative Filteringcited by 5
12 most cited of 34 All 34 (JSON)
- 2026Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval1 Jul 2026
- 2026Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendation1 Jun 2026
- 2025Hard vs. Noise: Resolving Hard-Noisy Sample Confusion in Recommender Systems via Large Language Models10 Nov 2025
- 2025Beyond Single Labels: Improving Conversational Recommendation through LLM-Powered Data Augmentation30 Jul 2025
- 2025BehaveGPT: A Foundation Model for Large-scale User Behavior Modeling23 May 2025
- 2025Large language model as user daily behavior data generator: balancing population diversity and individual personality23 May 2025
- 2025MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendation12 Feb 2025
- 2024End-to-end Training for Recommendation with Language-based User Profiles24 Oct 2024
- 2024Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs27 Sep 2024
- 2024Large Language Model Enhanced Hard Sample Identification for Denoising Recommendation16 Sep 2024
- 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenders5 Aug 2024
- 2024Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity1 Aug 2024
12 newest of 34 All 34 (JSON)