Séminaire Donnees et APprentissage ArtificielRSS

Exploration and Exploitation of Scratch Games

http://webia.lip6.fr/~dapa/web/?q=seminaires
27/06/2013
Intervenant(s) : Raphaël Féraud (Orange Labs)
We consider a variant of the multi-armed bandit model, which we call scratch games, where the sequences of rewards are finite and drawn in advance with unknown starting dates. This new problem is motivated by online advertising applications where the number of ad displays is fixed according to a contract between the advertiser and the publisher, and where a new ad may appear at any time. The drawn-in-advance assumption is natural for the adversarial approach where an oblivious adversary is supposed to choose the reward sequences in advance. For the stochastic setting, it is functionally equivalent to an urn where draws are performed without replacement. The non-replacement assumption is suited to the sequential design of non-reproducible experiments, which is often the case in real world. By adapting the standard multi-armed bandit algorithms to take advantage of this setting, we propose three new algorithms: the first one is designed for adversarial rewards; the second one assumes a stochastic urn model; and the last one is based on a Bayesian approach. For the adversarial and stochastic approaches, we provide upper bounds of the regret which compare favorably with the ones of Exp3 and UCB1. We also confirm experimentally that these algorithms compare favorably with Exp3, UCB1 and Thompson Sampling by simulation with synthetic models and ad-serving data.
Keywords adversarial multi-armed bandits ; stochastic multi-armed bandits ; finite sequences ; scratch games.

Plus d'informations ici …
Adrien.Revault-d'Allonnes (at) nulllip6.fr
Mentions légales
Carte du site