High Accuracy and Low Regret for User-Cold-Start Using Latent Bandits
This addresses the challenge of providing effective recommendations for new users in systems like online platforms, though it appears incremental as it builds on existing latent-bandit approaches.
The paper tackled the cold-start problem for new users in recommender systems by developing a novel latent-bandit algorithm, which achieved higher accuracy and lower regret compared to state-of-the-art methods.
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.