Bandits and Recommender Systems

Jérémie Mary 1, 2 Romaric Gaudel 1, 2 Philippe Preux 1, 2
2 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : This paper addresses the on-line recommendation problem facing new users and new items; we assume that no information is available neither about users, nor about the items. The only source of information is a set of ratings given by users to some items. By on-line, we mean that the set of users, and the set of items, and the set of ratings is evolving along time and that at any moment, the recommendation system has to select items to recommend based on the currently available information, that is basically the sequence of past events. We also mean that each user comes with her preferences which may evolve along short and longer scales of time; so we have to continuously update their preferences. When the set of ratings is the only available source of information , the traditional approach is matrix factorization. In a decision making under uncertainty setting, actions should be selected to balance exploration with exploitation; this is best modeled as a bandit problem. Matrix factors provide a latent representation of users and items. These representations may then be used as contextual information by the bandit algorithm to select items. This last point is exactly the originality of this paper: the combination of matrix factorization and bandit algorithms to solve the on-line recommendation problem. Our work is driven by considering the recommendation problem as a feedback controlled loop. This leads to interactions between the representation learning, and the recommendation policy.
Type de document :
Communication dans un congrès
First International Workshop on Machine Learning, Optimization, and Big Data (MOD'15), Jul 2015, Taormina, Italy. Springer International Publishing, Lecture Notes in Computer Science, 9432, pp.325-336, 2016, Lecture Notes in Computer Science. 〈http://link.springer.com/chapter/10.1007/978-3-319-27926-8_29〉. 〈10.1007/978-3-319-27926-8_29〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01256033
Contributeur : Romaric Gaudel <>
Soumis le : jeudi 14 janvier 2016 - 11:50:31
Dernière modification le : jeudi 11 janvier 2018 - 06:27:32
Document(s) archivé(s) le : vendredi 11 novembre 2016 - 05:26:16

Fichiers

Bandits_and_Recommender_System...
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Jérémie Mary, Romaric Gaudel, Philippe Preux. Bandits and Recommender Systems. First International Workshop on Machine Learning, Optimization, and Big Data (MOD'15), Jul 2015, Taormina, Italy. Springer International Publishing, Lecture Notes in Computer Science, 9432, pp.325-336, 2016, Lecture Notes in Computer Science. 〈http://link.springer.com/chapter/10.1007/978-3-319-27926-8_29〉. 〈10.1007/978-3-319-27926-8_29〉. 〈hal-01256033〉

Partager

Métriques

Consultations de la notice

261

Téléchargements de fichiers

551