mlsanityData to 7 Oct 2026

Latent Contextual Bandits and their Application to Personalized Recommendations for New Users

arXiv 1604.06743 ↗First posted 22 Apr 2016cs.LG cs.AIcited by 18

Not on the map. Why?

Abstract (arXiv)

Personalized recommendations for new users, also known as the cold-start problem, can be formulated as a contextual bandit problem. Existing contextual bandit algorithms generally rely on features alone to capture user variability. Such methods are inefficient in learning new users' interests. In this paper we propose Latent Contextual Bandits. We consider both the benefit of leveraging a set of learned latent user classes for new users, and how we can learn such latent classes from prior users. We show that our approach achieves a better regret bound than existing algorithms. We also demonstrate the benefit of our approach using a large real world dataset and a preliminary user study.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Apr 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 1; 2023: 4; 2024: 4; 2025: 2; 2026: 2.

18 papers.

Sort: