Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Personalized Negative Reservoir for Incremental Learning in Recommender Systems (2403.03993v1)

Published 6 Mar 2024 in cs.IR and cs.AI

Abstract: 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 take the first step to propose, a personalized negative reservoir strategy which is used to obtain negative samples for the standard triplet loss. This 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 in standard benchmarks, on multiple standard top-k evaluation metrics.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Structure Aware Experience Replay for Incremental Learning in Graph-based Recommender Systems. In Proc. ACM Int. Conf. Info. & Knowledge Management (CIKM). 2832–2836.
  2. Structural Deep Clustering Network. In Proc. World Wide Web Conf. (WWW). 1400–1410.
  3. Liwei Cai and William Yang Wang. 2018. KBGAN: Adversarial Learning for Knowledge Graph Embeddings. In Proc. Conf. N. American Chapter Assoc. Computational Linguistics. New Orleans, LA, USA.
  4. Word2vec applied to recommendation: Hyperparameters matter. In Proceedings of the 12th ACM Conference on Recommender Systems. 352–356.
  5. End-to-End Incremental Learning. In Proc. European Conf. Computer Vision (ECCV). 241–257.
  6. Wide & Deep Learning for Recommender Systems. In Proc. ACM Recommender Syst. Conf. - Workshop on Deep Learning for Recommender Syst. (Boston, MA, USA). 7–10.
  7. Deep neural networks for youtube recommendations. In Proc. ACM Conf. Recommender Syst. 191–198.
  8. Continuous-time sequential recommendation with temporal graph collaborative transformer. In Proc. ACM Int. Conf. Info. & Knowledge Management (CIKM). 433–442.
  9. Deepfm: a factorization-machine based neural network for ctr prediction. In Proc. Int. Joint. Conf. Artificial Intelligence (IJCAI). 1725–1731.
  10. LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. In SIGIR. ACM.
  11. A Survey on User Behavior Modeling in Recommender Systems. (2023).
  12. Balázs Hidasi and Alexandros Karatzoglou. 2018. Recurrent neural networks with top-k gains for session-based recommendations. In Proc. ACM Int. Conf. Info. & Knowledge Management (CIKM). 843–852.
  13. Distilling the Knowledge in a Neural Network. CoRR arXiv (2015).
  14. C. A. R. Hoare. 1961. Algorithm 65: Find. Commun. ACM 4, 7 (Jul. 1961), 321–322.
  15. Wang-Cheng Kang and Julian McAuley. 2018. Self-attentive sequential recommendation. In Proc. IEEE Int. Conf. Data Mining (ICDM). 197–206.
  16. Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. CoRR abs/1412.6980 (2015).
  17. Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In Proc. Int. Conf. Learning Representations (ICLR).
  18. Overcoming catastrophic forgetting in neural networks. National Academy of Sciences 114, 13 (2017), 3521–3526.
  19. S. Kullback and R. A. Leibler. 1951. On Information and Sufficiency. The Annals of Mathematical Statistics 22 (1951), 79 – 86.
  20. GDumb: A simple approach that questions our progress in continual learning. In European Conf. Computer Vision (ECCV). 524–540.
  21. iCarl: Incremental classifier and representation learning. In Proc. IEEE Conf. Computer Vision and Pattern Recognition. 2001–2010.
  22. Steffen Rendle and Christoph Freudenthaler. 2014a. Improving pairwise learning for item recommendation from implicit feedback. In Proceedings of the 7th ACM international conference on Web search and data mining. 273–282.
  23. Steffen Rendle and Christoph Freudenthaler. 2014b. Improving pairwise learning for item recommendation from implicit feedback. In Proc. Int. Conf. Web Search and Data Mining (WSDM). New York, NY, USA, 273–282.
  24. BPR: Bayesian Personalized Ranking from Implicit Feedback. In Proc. Conf. on Uncertainty in Artificial Intell. (UAI). Montreal, Canada, 452–461.
  25. Incremental Learning of Object Detectors Without Catastrophic Forgetting. In Proc. Int. Conf. Computer Vision (ICCV). 3400–3409.
  26. Multi-Graph Convolution Collaborative Filtering. In Proc. IEEE Int. Conf. Data Mining (ICDM). 1306–1311.
  27. Graph Convolutional Matrix Completion. In ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining - Deep Learning Day Workshop.
  28. Attributed Graph Clustering: A Deep Attentional Embedding Approach. In Proc. Int. Joint Conf. Artificial Intelligence (IJCAI) (Macao, China). 3670–3676.
  29. Streaming Graph Neural Networks via Continual Learning. In Proc. ACM Int. Conf. Info. & Knowledge Management. 1515–1524.
  30. Irgan: A minimax game for unifying generative and discriminative information retrieval models. In Proc. Int. ACM SIGIR Conf. Research and Dev. Info. Retrieval. 515–524.
  31. Incorporating gan for negative sampling in knowledge representation learning. In Proc. Conf. Artificial Intell. (AAAI), Vol. 32.
  32. Graph learning based recommender systems: A review. In Proc. Int. Joint. Conf. Artificial Intelligence (IJCAI). 4644–4652.
  33. Neural Graph Collaborative Filtering. In Proc. ACM Int. Conf. Research and Development in Info. Retrieval. 165–174.
  34. Graph Structure Aware Contrastive Knowledge Distillation for Incremental Learning in Recommender Systems. In Proc. ACM Int. Conf. Info. & Knowledge Management. 3518–3522.
  35. Structure Aware Incremental Learning with Personalized Imitation Weights for Recommender Systems. In Proc. AAAI Conf. Artificial Intelligence. 4711–4719.
  36. Large scale image annotation: learning to rank with joint word-image embeddings. Machine Learning 81 (2010), 21–35.
  37. GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systems. In Proc. ACM Int. Conf. Info. & Knowledge Management. 2861–2868.
  38. Distilling Knowledge from Graph Convolutional Networks. In Proc. IEEE Conf. Computer Vision Pattern Recognition (CVPR). 7074–7083.
  39. Graph convolutional neural networks for web-scale recommender systems. In Proc. Int. Conf. Knowledge Discovery & Data Mining (KDD). London, UK, 974–983.
  40. Hierarchical Graph Representation Learning with Differentiable Pooling. In Proc. Adv. Neural Inf. Process. Syst. (NeurIPS). Montréal, Canada, 4805–4815.
  41. A Biased Sampling Method for Imbalanced Personalized Ranking. In Proc. ACM Int. Conf. Info. Knowledge Management (CIKM) (Atlanta, GA, USA). 2393–2402.
  42. Optimizing top-n collaborative filtering via dynamic negative item sampling. In Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval. 785–788.
  43. NSCaching: simple and efficient negative sampling for knowledge graph embedding. In IEEE Int. Conf. Data Engineering (ICDE). 614–625.
  44. Improving latent factor models via personalized feature projection for one class recommendation. In Proceedings of the 24th ACM international on conference on information and knowledge management. 821–830.

Summary

We haven't generated a summary for this paper yet.