mlsanityData to 14 Oct 2026

Personalized Negative Reservoir for Incremental Learning in Recommender Systems

arXiv 2403.03993 ↗First posted 6 Mar 2024cs.IR cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Recommender systems have become an integral part of online platforms. Every day the volume of training data is expanding and the number of user interactions is constantly increasing. The exploration of larger and more expressive models has become a necessary pursuit to improve user experience. However, this progression carries with it an increased computational burden. In commercial settings, once a recommendation system model has been trained and deployed it typically needs to be updated frequently as new client data arrive. Cumulatively, the mounting volume of data is guaranteed to eventually make full batch retraining of the model from scratch computationally infeasible. Naively fine-tuning solely on the new data runs into the well-documented problem of catastrophic forgetting. Despite the fact that negative sampling is a crucial part of training with implicit feedback, no specialized technique exists that is tailored to the incremental learning framework. In this work, we propose a personalized negative reservoir strategy, which is used to obtain negative samples for the standard triplet loss of graph-based recommendation systems. Our technique balances alleviation of forgetting with plasticity by encouraging the model to remember stable user preferences and selectively forget when user interests change. We derive the mathematical formulation of a negative sampler to populate and update the reservoir. We integrate our design in three SOTA and commonly used incremental recommendation models. We show that these concrete realizations of our negative reservoir framework achieve state-of-the-art results for standard benchmarks using multiple top-k evaluation metrics.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 32 of its 56 references that are in the map. First posted on arXiv 6 Mar 2024.

Builds on

32 of 56 references.

References · 32

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  5. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  6. 2018Self-Attentive Sequential Recommendationcited by 1,184
  7. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  8. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
  9. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
  10. 2016Wide & Deep Learning for Recommender Systemscited by 747
  11. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
  12. 2019Neural Graph Collaborative Filteringcited by 661
20 more
  1. 2018End-to-End Incremental Learningcited by 597
  2. 2017Incremental Learning of Object Detectors without Catastrophic Forgettingcited by 208
  3. 2017Recurrent Neural Networks with Top-k Gains for Session-based Recommendationscited by 165
  4. 2019Attributed Graph Clustering: A Deep Attentional Embedding Approachcited by 149
  5. 2020Structural Deep Clustering Networkcited by 145
  6. 2020Distilling Knowledge from Graph Convolutional Networkscited by 129
  7. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  8. 2021Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformercited by 69
  9. 2020Streaming Graph Neural Networks via Continual Learningcited by 64
  10. 2017KBGAN: Adversarial Learning for Knowledge Graph Embeddingscited by 62
  11. 2021Graph Learning based Recommender Systems: A Reviewcited by 59
  12. 2018NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embeddingcited by 42
  13. 2020GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systemscited by 42
  14. 2018Incorporating GAN for Negative Sampling in Knowledge Representation Learningcited by 31
  15. 2020Multi-Graph Convolution Collaborative Filteringcited by 27
  16. 2023A Survey on User Behavior Modeling in Recommender Systemscited by 26
  17. 2018Word2Vec applied to Recommendation: Hyperparameters Mattercited by 20
  18. 2022Motion Inbetweening via Deep Delta-Interpolatorcited by 16
  19. 2023Structure Aware Incremental Learning with Personalized Imitation Weights for Recommender Systemscited by 9
  20. 2023Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embeddingcited by 7

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.