Profile-Based Bandit with Unknown Profiles

Abstract : Stochastic bandits have been widely studied since decades. A very large panel of settings have been introduced, some of them for the inclusion of some structure between actions. If actions are associated with feature vectors that underlie their usefulness, the discovery of a mapping parameter between such profiles and rewards can help the exploration process of the bandit strategies. This is the setting studied in this paper, but in our case the action profiles (constant feature vectors) are unknown beforehand. Instead, the agent is only given sample vectors, with mean centered on the true profiles, for a subset of actions at each step of the process. In this new bandit instance, policies have thus to deal with a doubled uncertainty, both on the profile estimators and the reward mapping parameters learned so far. We propose a new algorithm, called \textit{SampLinUCB}, specifically designed for this case. Theoretical convergence guarantees are given for this strategy, according to various profile samples delivery scenarios. Finally, experiments are conducted on both artificial data and a task of focused data capture from online social networks. Obtained results demonstrate the relevance of the approach in various settings.
Document type :
Journal articles
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-02074907
Contributor : Sylvain Lamprier <>
Submitted on : Thursday, March 21, 2019 - 9:03:26 AM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

Identifiers

  • HAL Id : hal-02074907, version 1

Citation

Sylvain Lamprier, Thibault Gisselbrecht, Patrick Gallinari. Profile-Based Bandit with Unknown Profiles. Journal of Machine Learning Research, Microtome Publishing, 2018, 19 (53), pp.53:1--53:40. ⟨hal-02074907⟩

Share

Metrics

Record views

23