BanditMF: Multi-Armed Bandit Based Matrix Factorization Recommender System
Shenghao Xu

TL;DR
BanditMF introduces a novel multi-armed bandit based matrix factorization approach to improve recommender systems, effectively addressing cold start issues and user correlation challenges in dynamic environments.
Contribution
This paper presents BanditMF, a new method combining bandit algorithms with matrix factorization to enhance collaborative filtering in recommender systems.
Findings
Improves cold start recommendation accuracy.
Effectively models user correlations in recommendations.
Reduces sub-optimal recommendations in social domains.
Abstract
Multi-armed bandits (MAB) provide a principled online learning approach to attain the balance between exploration and exploitation. Due to the superior performance and low feedback learning without the learning to act in multiple situations, Multi-armed Bandits drawing widespread attention in applications ranging such as recommender systems. Likewise, within the recommender system, collaborative filtering (CF) is arguably the earliest and most influential method in the recommender system. Crucially, new users and an ever-changing pool of recommended items are the challenges that recommender systems need to address. For collaborative filtering, the classical method is training the model offline, then perform the online testing, but this approach can no longer handle the dynamic changes in user preferences which is the so-called cold start. So how to effectively recommend items to users…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Recommender Systems and Techniques · Data Stream Mining Techniques
