Generating Negative Samples for Sequential Recommendation
Not on the map. Why?
Abstract (arXiv)
To make Sequential Recommendation (SR) successful, recent works focus on designing effective sequential encoders, fusing side information, and mining extra positive self-supervision signals. The strategy of sampling negative items at each time step is less explored. Due to the dynamics of users' interests and model updates during training, considering randomly sampled items from a user's non-interacted item set as negatives can be uninformative. As a result, the model will inaccurately learn user preferences toward items. Identifying informative negatives is challenging because informative negative items are tied with both dynamically changed interests and model parameters (and sampling process should also be efficient). To this end, we propose to Generate Negative Samples (items) for SR (GenNi). A negative item is sampled at each time step based on the current SR model's learned user preferences toward items. An efficient implementation is proposed to further accelerate the generation process, making it scalable to large-scale recommendation tasks. Extensive experiments on four public datasets verify the importance of providing high-quality negative samples for SR and demonstrate the effectiveness and efficiency of GenNi.
Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 31 of its 51 references that are in the map. First posted on arXiv 7 Aug 2022.
Builds on
31 of 51 references.
References · 31
- 2017Attention Is All You Needcited by 60,106
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,467
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,915
- 2018Self-Attentive Sequential Recommendationcited by 1,175
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,135
- 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 958
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 894
- 2015Image-based Recommendations on Styles and Substitutescited by 703
- 2015Session-based Recommendations with Recurrent Neural Networkscited by 688
- 2019Neural Graph Collaborative Filteringcited by 660
- 2020Contrastive Learning with Hard Negative Samplescited by 619
19 more
- 2015LINE: Large-scale Information Network Embeddingcited by 582
- 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 475
- 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
- 2017Recurrent Neural Networks with Top-k Gains for Session-based Recommendationscited by 165
- 2016Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendationcited by 152
- 2021Contrastive Learning for Representation Degeneration Problem in Sequential Recommendationcited by 121
- 2018Noise Contrastive Estimation and Negative Sampling for Conditional Models: Consistency and Statistical Efficiencycited by 103
- 2022Intent Contrastive Learning for Sequential Recommendationcited by 90
- 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
- 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
- 2017KBGAN: Adversarial Learning for Knowledge Graph Embeddingscited by 62
- 2021Contrastive Self-supervised Sequential Recommendation with Robust Augmentationcited by 56
- 2021Understanding Hard Negatives in Noise Contrastive Estimationcited by 39
- 2017Adaptive Sampled Softmax with Kernel Based Samplingcited by 38
- 2020Contrastive Learning for Debiased Candidate Generation in Large-Scale Recommender Systemscited by 38
- 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
- 2021Lightweight Self-Attentive Sequential Recommendationcited by 22
- 2021Memory Augmented Multi-Instance Contrastive Predictive Coding for Sequential Recommendationcited by 16
- 2022ELECRec: Training Sequential Recommenders as Discriminatorscited by 3
Built on by
Citing papers per year: 2024: 3.
3 papers.
- 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenderscited by 9
- 2024Evaluating Performance and Bias of Negative Sampling in Large-Scale Sequential Recommendation Modelscited by 4
- 2024Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivitycited by 0
- 2024Evaluating Performance and Bias of Negative Sampling in Large-Scale Sequential Recommendation Models8 Oct 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