SPR:Supervised Personalized Ranking Based on Prior Knowledge for
Recommendation
- URL: http://arxiv.org/abs/2207.03197v1
- Date: Thu, 7 Jul 2022 10:00:54 GMT
- Title: SPR:Supervised Personalized Ranking Based on Prior Knowledge for
Recommendation
- Authors: Chun Yang, Shicai Fan
- Abstract summary: We propose a novel loss function named Supervised Personalized Ranking (SPR) Based on Prior Knowledge.
Unlike BPR, instead of constructing user, positive item, negative item> triples, the proposed SPR constructs user, similar user, positive item, negative item> quadruples.
- Score: 6.407166061614783
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendation [59.500347564280204]
We propose a new Aleatoric Uncertainty-aware Recommendation (AUR) framework.
AUR consists of a new uncertainty estimator along with a normal recommender model.
As the chance of mislabeling reflects the potential of a pair, AUR makes recommendations according to the uncertainty.
arXiv Detail & Related papers (2022-09-22T04:32:51Z) - Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
We show how to return a set of items rigorously guaranteed to contain mostly good items.
Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate.
We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
arXiv Detail & Related papers (2022-07-04T17:49:25Z) - Cross Pairwise Ranking for Unbiased Item Recommendation [57.71258289870123]
We develop a new learning paradigm named Cross Pairwise Ranking (CPR)
CPR achieves unbiased recommendation without knowing the exposure mechanism.
We prove in theory that this way offsets the influence of user/item propensity on the learning.
arXiv Detail & Related papers (2022-04-26T09:20:27Z) - Determinantal Point Process Likelihoods for Sequential Recommendation [12.206748373325972]
We propose two new loss functions based on the Determinantal Point Process (DPP) likelihood, that can be adaptively applied to estimate the subsequent item or items.
Experimental results using the proposed loss functions on three real-world datasets show marked improvements over state-of-the-art sequential recommendation methods in both quality and diversity metrics.
arXiv Detail & Related papers (2022-04-25T11:20:10Z) - Unbiased Pairwise Learning to Rank in Recommender Systems [4.058828240864671]
Unbiased learning to rank algorithms are appealing candidates and have already been applied in many applications with single categorical labels.
We propose a novel unbiased LTR algorithm to tackle the challenges, which innovatively models position bias in the pairwise fashion.
Experiment results on public benchmark datasets and internal live traffic show the superior results of the proposed method for both categorical and continuous labels.
arXiv Detail & Related papers (2021-11-25T06:04:59Z) - Understanding the Effects of Adversarial Personalized Ranking
Optimization Method on Recommendation Quality [6.197934754799158]
We model the learning characteristics of the Bayesian Personalized Ranking (BPR) and APR optimization frameworks.
We show that APR amplifies the popularity bias more than BPR due to an unbalanced number of received positive updates from short-head items.
arXiv Detail & Related papers (2021-07-29T10:22:20Z) - On component interactions in two-stage recommender systems [82.38014314502861]
Two-stage recommenders are used by many online platforms, including YouTube, LinkedIn, and Pinterest.
We show that interactions between the ranker and the nominators substantially affect the overall performance.
In particular, using a Mixture-of-Experts approach, we train the nominators to specialize on different subsets of the item pool.
arXiv Detail & Related papers (2021-06-28T20:53:23Z) - Scalable Personalised Item Ranking through Parametric Density Estimation [53.44830012414444]
Learning from implicit feedback is challenging because of the difficult nature of the one-class problem.
Most conventional methods use a pairwise ranking approach and negative samplers to cope with the one-class problem.
We propose a learning-to-rank approach, which achieves convergence speed comparable to the pointwise counterpart.
arXiv Detail & Related papers (2021-05-11T03:38:16Z) - Towards Comprehensive Recommender Systems: Time-Aware
UnifiedcRecommendations Based on Listwise Ranking of Implicit Cross-Network
Data [33.17802459749589]
We propose a novel deep learning based unified cross-network solution to mitigate cold-start and data sparsity issues.
We show that the proposed solution is superior in terms of accuracy, novelty and diversity.
Experiments conducted on the popular MovieLens dataset suggest that the proposed listwise ranking method outperforms existing state-of-the-art ranking techniques.
arXiv Detail & Related papers (2020-08-25T08:08:03Z) - Self-Supervised Reinforcement Learning for Recommender Systems [77.38665506495553]
We propose self-supervised reinforcement learning for sequential recommendation tasks.
Our approach augments standard recommendation models with two output layers: one for self-supervised learning and the other for RL.
Based on such an approach, we propose two frameworks namely Self-Supervised Q-learning(SQN) and Self-Supervised Actor-Critic(SAC)
arXiv Detail & Related papers (2020-06-10T11:18:57Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.