Revisiting Negative Sampling vs. Non-sampling in Implicit Recommendation
TL;DR: The role of negative sampling and non-sampling for implicit recommendation is analyzed, and the results empirically show that although negative sampling has been widely applied to recent recommendation models, it is non-trivial for uniform sampling methods to show comparable performance to non-Sampling learning methods.
read more
Abstract: Recommendation systems play an important role in alleviating the information overload issue. Generally, a recommendation model is trained to discern between positive (liked) and negative (disliked) instances for each user. However, under the open-world assumption, there are only positive instances but no negative instances from users’ implicit feedback, which poses the imbalanced learning challenge of lacking negative samples. To address this, two types of learning strategies have been proposed before, the negative sampling strategy and non-sampling strategy. The first strategy samples negative instances from missing data (i.e., unlabeled data), while the non-sampling strategy regards all the missing data as negative. Although learning strategies are known to be essential for algorithm performance, the in-depth comparison of negative sampling and non-sampling has not been sufficiently explored by far. To bridge this gap, we systematically analyze the role of negative sampling and non-sampling for implicit recommendation in this work. Specifically, we first theoretically revisit the objection of negative sampling and non-sampling. Then, with a careful setup of various representative recommendation methods, we explore the performance of negative sampling and non-sampling in different scenarios. Our results empirically show that although negative sampling has been widely applied to recent recommendation models, it is non-trivial for uniform sampling methods to show comparable performance to non-sampling learning methods. Finally, we discuss the scalability and complexity of negative sampling and non-sampling and present some open problems and future research topics that are worth being further explored.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
LLMRec: Large Language Models with Graph Augmentation for Recommendation
Wei Wei,Xubin Ren,Jiabin Tang,Qinyong Wang,Lixin Su,Su-hua Cheng,Junfeng Wang,Dawei Yin,Chao Huang +8 more
TL;DR: A novel framework called LLMRec is proposed that enhances recommender systems by employing three simple yet effective LLM-based graph augmentation strategies and develops a denoised data robustification mechanism that includes techniques of noisy implicit feedback pruning and MAE-based feature enhancement that help refine the augmented data and improve its reliability.
SelfCF: A Simple Framework for Self-supervised Collaborative Filtering
20 Apr 2023
TL;DR: SelfCF as mentioned in this paper proposes a self-supervised collaborative filtering framework to augment the output embeddings generated by backbone networks, which can be easily applied to existing deep learning based collaborative filtering models.
LLMRec: Large Language Models with Graph Augmentation for Recommendation
Wei Wei,Xubin Ren,Jiabin Tang,Qinyong Wang,Lixin Su,Suqi Cheng,Junfeng Wang,Dawei Yin,Chao Huang +8 more
- 04 Mar 2024
TL;DR: LLMRec employs LLM-based graph augmentation strategies to address data sparsity challenges in recommendation systems. It leverages rich content from online platforms to augment the interaction graph and enhance user-item interactions, item attributes, and user profiling.
38
TEINet: a deep learning framework for prediction of TCR–epitope binding specificity
TL;DR: TE as discussed by the authors employs two separately pretrained encoders to transform TCR and epitope sequences into numerical vectors, which are subsequently fed into a fully connected neural network to predict their binding specificities.
29
On the Theories Behind Hard Negative Sampling for Recommendation
Wentao Shi,Jiawei Chen,Fuli Feng,Jizhi Zhang,Junkang Wu,Chong Gao,Xiangnan He +6 more
- 07 Feb 2023
TL;DR: In this article , a theoretical analysis of negative sampling on the Bayesian Personalized Ranking (BPR) learner is conducted, and it is shown that the sampling hardness should be controllable, e.g., via pre-defined hyper-parameters, to adapt to different top-K metrics and datasets.
References
•Posted Content
Distributed Representations of Words and Phrases and their Compositionality
TL;DR: In this paper, the Skip-gram model is used to learn high-quality distributed vector representations that capture a large number of precise syntactic and semantic word relationships and improve both the quality of the vectors and the training speed.
Matrix Factorization Techniques for Recommender Systems
TL;DR: As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels.
DeepWalk: online learning of social representations
Bryan Perozzi,Rami Al-Rfou,Steven Skiena +2 more
- 24 Aug 2014
TL;DR: DeepWalk as mentioned in this paper uses local information obtained from truncated random walks to learn latent representations by treating walks as the equivalent of sentences, which encode social relations in a continuous vector space, which is easily exploited by statistical models.
Item-based collaborative filtering recommendation algorithms
Badrul Sarwar,George Karypis,Joseph A. Konstan,John Riedl +3 more
- 01 Apr 2001
TL;DR: This paper analyzes item-based collaborative ltering techniques and suggests that item- based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.
node2vec: Scalable Feature Learning for Networks
Aditya Grover,Jure Leskovec +1 more
- 13 Aug 2016
TL;DR: Node2vec as mentioned in this paper learns a mapping of nodes to a low-dimensional space of features that maximizes the likelihood of preserving network neighborhoods of nodes by using a biased random walk procedure.