Learning Explicit User Interest Boundary for Recommendation

11/22/2021
by   Jianhuan Zhuo, et al.
0

The core objective of modelling recommender systems from implicit feedback is to maximize the positive sample score s_p and minimize the negative sample score s_n, which can usually be summarized into two paradigms: the pointwise and the pairwise. The pointwise approaches fit each sample with its label individually, which is flexible in weighting and sampling on instance-level but ignores the inherent ranking property. By qualitatively minimizing the relative score s_n - s_p, the pairwise approaches capture the ranking of samples naturally but suffer from training efficiency. Additionally, both approaches are hard to explicitly provide a personalized decision boundary to determine if users are interested in items unseen. To address those issues, we innovatively introduce an auxiliary score b_u for each user to represent the User Interest Boundary(UIB) and individually penalize samples that cross the boundary with pairwise paradigms, i.e., the positive samples whose score is lower than b_u and the negative samples whose score is higher than b_u. In this way, our approach successfully achieves a hybrid loss of the pointwise and the pairwise to combine the advantages of both. Analytically, we show that our approach can provide a personalized decision boundary and significantly improve the training efficiency without any special sampling strategy. Extensive results show that our approach achieves significant improvements on not only the classical pointwise or pairwise models but also state-of-the-art models with complex loss function and complicated feature encoding.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 11

01/19/2021

Density-Ratio Based Personalised Ranking from Implicit Feedback

Learning from implicit user feedback is challenging as we can only obser...
08/15/2018

Neural Collaborative Ranking

Recommender systems are aimed at generating a personalized ranked list o...
01/19/2022

Learning to Rank For Push Notifications Using Pairwise Expected Regret

Listwise ranking losses have been widely studied in recommender systems....
05/19/2020

Addressing Class-Imbalance Problem in Personalized Ranking

Pairwise ranking models have been widely used to address recommendation ...
05/11/2021

Scalable Personalised Item Ranking through Parametric Density Estimation

Learning from implicit feedback is challenging because of the difficult ...
05/02/2019

Spectrum-enhanced Pairwise Learning to Rank

To enhance the performance of the recommender system, side information i...
09/21/2018

Sampler Design for Bayesian Personalized Ranking by Leveraging View Data

Bayesian Personalized Ranking (BPR) is a representative pairwise learnin...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.