mlsanityData to 14 Oct 2026

SPR:Supervised Personalized Ranking Based on Prior Knowledge for Recommendation

arXiv 2207.03197 ↗First posted 7 Jul 2022cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The goal of a recommendation system is to model the relevance between each user and each item through the user-item interaction history, so that maximize the positive samples score and minimize negative samples. Currently, two popular loss functions are widely used to optimize recommender systems: the pointwise and the pairwise. Although these loss functions are widely used, however, there are two problems. (1) These traditional loss functions do not fit the goals of recommendation systems adequately and utilize prior knowledge information sufficiently. (2) The slow convergence speed of these traditional loss functions makes the practical application of various recommendation models difficult. To address these issues, we propose a novel loss function named Supervised Personalized Ranking (SPR) Based on Prior Knowledge. The proposed method improves the BPR loss by exploiting the prior knowledge on the interaction history of each user or item in the raw data. Unlike BPR, instead of constructing <user, positive item, negative item> triples, the proposed SPR constructs <user, similar user, positive item, negative item> quadruples. Although SPR is very simple, it is very effective. Extensive experiments show that our proposed SPR not only achieves better recommendation performance, but also significantly accelerates the convergence speed, resulting in a significant reduction in the required training time.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 7 Jul 2022.

Builds on

18 of 31 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  3. 2017Neural Collaborative Filteringcited by 1,111
  4. 2019Neural Graph Collaborative Filteringcited by 661
  5. 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
  6. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 520
  7. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
  8. 2018Variational Autoencoders for Collaborative Filteringcited by 310
  9. 2020Self-supervised Graph Learning for Recommendationcited by 305
  10. 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
  11. 2019Practice on Long Sequential User Behavior Modeling for Click-Through Rate Predictioncited by 118
  12. 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
6 more
  1. 2015Modeling User Exposure in Recommendationcited by 69
  2. 2021AutoLoss: Automated Loss Function Search in Recommendationscited by 31
  3. 2018Collaborative Memory Network for Recommendation Systemscited by 30
  4. 2022Supervised Contrastive Learning for Recommendationcited by 7
  5. 2021Learning Explicit User Interest Boundary for Recommendationcited by 6
  6. 2018Metric Factorization: Recommendation beyond Matrix Factorizationcited by 5

Built on by

Not cited yet.