Hello, hope you ae doing great.
I recently had to chose a paper for my Bayesian Machine Learning course and I found this amazing one : Bayesian Personalized Ranking from Implicit Feedback
So, while presenting this paper and making a project based on this paper I am deciding to document the journey and this is the first blog in this series.
In this, I’m gonna cover what this paper tries to solve.
So, here is Part 1 : Understanding the Paper.
Let’s See The Big Picture
Introduction
- Recommender systems are crucial for many online platforms, helping users navigate vast amounts of content and discover items they might find interesting FASTER.
- Till now , Collaborative filtering techniques, adaptive k-nn and Matrix Factorization in particular, leverage past user interactions to predict preferences.
- This paper focuses on item recommendation using implicit feedback, a prevalent but challenging scenario in real-world systems.
- Why Implicit Feedback? Implicit feedback is easy to collect and exists of every user , ratings on the other hand are not available for every user.
Utility of this paper
- A key limitation of many existing recommender systems, the paper argues, lies in their indirect approach to personalization.
- While these systems provide user-specific recommendations, they often rely on predicting a general ranking system between user and an item (represented as $x_{ul}$) rather than directly optimizing for the ranking of items for each user.
- This approach, while computationally convenient, might not accurately capture the nuanced pairwise preferences (for i , j represented as $x_{uij}$ ) that are essential for generating truly personalized rankings.
- Also , we noticed that using the two algorithms (BPR-Opt and LearnBPR) we found that the accuracy of predicting these ranking systems drastically improved (much higher than theoretical upper bound)