Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation (Extended Abstract)

by   Aleksandra Burashnikova, et al.

This paper is an extended version of [Burashnikova et al., 2021, arXiv: 2012.06910], where we proposed a theoretically supported sequential strategy for training a large-scale Recommender System (RS) over implicit feedback, mainly in the form of clicks. The proposed approach consists in minimizing pairwise ranking loss over blocks of consecutive items constituted by a sequence of non-clicked items followed by a clicked one for each user. We present two variants of this strategy where model parameters are updated using either the momentum method or a gradient-based approach. To prevent updating the parameters for an abnormally high number of clicks over some targeted items (mainly due to bots), we introduce an upper and a lower threshold on the number of updates for each user. These thresholds are estimated over the distribution of the number of blocks in the training set. They affect the decision of RS by shifting the distribution of items that are shown to the users. Furthermore, we provide a convergence analysis of both algorithms and demonstrate their practical efficiency over six large-scale collections with respect to various ranking measures.


page 1

page 2

page 3

page 4


Learning over no-Preferred and Preferred Sequence of items for Robust Recommendation

In this paper, we propose a theoretically founded sequential strategy fo...

Sequential Learning over Implicit Feedback for Robust Large-Scale Recommender Systems

In this paper, we propose a robust sequential learning strategy for trai...

Recommender systems: when memory matters

In this paper, we study the effect of long memory in the learnability of...

Large-Scale Sequential Learning for Recommender and Engineering Systems

In this thesis, we focus on the design of an automatic algorithms that p...

Density-Ratio Based Personalised Ranking from Implicit Feedback

Learning from implicit user feedback is challenging as we can only obser...

Selective and Collaborative Influence Function for Efficient Recommendation Unlearning

Recent regulations on the Right to be Forgotten have greatly influenced ...

Evaluating Impact of User-Cluster Targeted Attacks in Matrix Factorisation Recommenders

In practice, users of a Recommender System (RS) fall into a few clusters...

Please sign up or login with your details

Forgot password? Click here to reset