Latent Contextual Bandits and their Application to Personalized Recommendations for New Users
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 3646-3652.
Abstract
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.
@inproceedings{ijcai2016p513,
title = {Latent Contextual Bandits and their Application to Personalized Recommendations for New Users},
author = {Zhou, Li and Brunskill, Emma},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {3646--3652},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/513},
}
TY - CPAPER TI - Latent Contextual Bandits and their Application to Personalized Recommendations for New Users AU - Zhou, Li AU - Brunskill, Emma T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 3646 EP - 3652 UR - https://ijcai.org/proceedings/2016/513 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: