High Accuracy and Low Regret for User-Cold-Start Using Latent Bandits

05/12/2023
by   David Young, et al.
0

We develop a novel latent-bandit algorithm for tackling the cold-start problem for new users joining a recommender system. This new algorithm significantly outperforms the state of the art, simultaneously achieving both higher accuracy and lower regret.

READ FULL TEXT
research
02/11/2015

Combinatorial Bandits Revisited

This paper investigates stochastic and adversarial combinatorial multi-a...
research
05/04/2019

Latent Unexpected and Useful Recommendation

Providing unexpected recommendations is an important task for recommende...
research
11/16/2022

Dueling Bandits: From Two-dueling to Multi-dueling

We study a general multi-dueling bandit problem, where an agent compares...
research
07/10/2014

Bandits Warm-up Cold Recommender Systems

We address the cold start problem in recommendation systems assuming no ...
research
09/30/2022

Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits

While standard bandit algorithms sometimes incur high regret, their perf...
research
04/04/2019

Empirical Bayes Regret Minimization

The prevalent approach to bandit algorithm design is to have a low-regre...
research
07/16/2020

Fast Distributed Bandits for Online Recommendation Systems

Contextual bandit algorithms are commonly used in recommender systems, w...

Please sign up or login with your details

Forgot password? Click here to reset