Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, March 11, 2021, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Maxime Larcher
The multi-armed bandit problem is a classical problem of computer science. At all steps t=1, 2, ..., T, an agent has to pull one of K arms and receives a reward drawn according to the chosen arm’s distribution; his goal is to maximise the total reward, or in other words, minimise the regret.
We consider the variant of this problem where the distributions of the rewards of all arms may change up to L times. Auer, Gajane and Ortner (2019) proposed the algorithm AdSwitch which achieves nearly optimal regret, without knowledge of L. We present a conceptually similar but simpler algorithm which achieves similar regret but has faster running time. We also simplify some parts of the theoretical analysis.
Automatic MiSe System Software Version 1.4803M | admin login