Bayesian Negative Sampling for Recommendation
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- SamWalker++: recommendation with informative sampling strategyIEEE Transactions on Knowledge and Data Engineering, 2021
- Graph Debiased Contrastive Learning with Joint Representation Clustering2021
- Reinforced Negative Sampling over Knowledge Graph for Recommendation2020
- Geo-ALM: POI Recommendation by Fusing Geographical Information and Adversarial Learning Mechanism2019
- Reinforced Negative Sampling for Recommendation with Exposure Data2019
- SamWalker: Social Recommendation with Informative Sampling Strategy2019
- Graph Convolutional Neural Networks for Web-Scale Recommender Systems2018
- Bootstrapping Entity Alignment with Knowledge Graph Embedding2018
- Matrix Factorization Techniques for Recommender SystemsComputer, 2009