Bayesian Negative Sampling for Recommendation
Not on the map. Why?
Abstract (arXiv)
How to sample high quality negative instances from unlabeled data, i.e., negative sampling, is important for training implicit collaborative filtering and contrastive learning models. Although previous studies have proposed some approaches to sample informative instances, few has been done to discriminating false negative from true negative for unbiased negative sampling. On the basis of our order relation analysis of negatives' scores, we first derive the class conditional density of true negatives and that of false negatives. We next design a Bayesian classifier for negative classification, from which we define a model-agnostic posterior probability estimate of an instance being true negative as a quantitative negative signal measure. We also propose a Bayesian optimal sampling rule to sample high-quality negatives. The proposed Bayesian Negative Sampling (BNS) algorithm has a linear time complexity. Experimental studies validate the superiority of BNS over the peers in terms of better sampling quality and better recommendation performance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 57 references that are in the map. First posted on arXiv 2 Apr 2022.
Builds on
21 of 57 references.
References · 21
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
- 2020Self-supervised Learning: Generative or Contrastivecited by 694
- 2019Neural Graph Collaborative Filteringcited by 661
- 2015LINE: Large-scale Information Network Embeddingcited by 582
- 2018Learning from positive and unlabeled data: a surveycited by 219
- 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 101
- 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
- 2017On Sampling Strategies for Neural Network-based Collaborative Filteringcited by 71
9 more
- 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
- 2018NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embeddingcited by 42
- 2020Reinforced Negative Sampling over Knowledge Graph for Recommendationcited by 40
- 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
- 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
- 2018Word2Vec applied to Recommendation: Hyperparameters Mattercited by 20
- 2021DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNNcited by 19
- 2021Relation-aware Graph Attention Model With Adaptive Self-adversarial Trainingcited by 12
- 2020SamWalker++: recommendation with informative sampling strategycited by 5
Built on by
Citing papers per year: 2025: 1.
1 paper.