Poster
Polynomial Cost of Adaptation for X-Armed Bandits
Hedi Hadiji
East Exhibition Hall B + C #26
Keywords: [ Algorithms; Algorithms -> Online Learning; Optimization -> Stochastic Optimization; Theory; Theory ] [ Frequentist Statistics ] [ Algorithms ] [ Bandit Algorithms ]
In the context of stochastic continuum-armed bandits, we present an algorithm that adapts to the unknown smoothness of the objective function. We exhibit and compute a polynomial cost of adaptation to the Hölder regularity for regret minimization. To do this, we first reconsider the recent lower bound of Locatelli and Carpentier, 2018, and define and characterize admissible rate functions. Our new algorithm matches any of these minimal rate functions. We provide a finite-time analysis and a thorough discussion about asymptotic optimality.
Live content is unavailable. Log in and register to view live content