We consider stochastic bandit problems with a continuum set of arms and where the expected reward is a continuous and unimodal function of the arm. No further assumption is made regarding the smoothness and the structure of the expected reward function. We propose Stochastic Pentachotomy (SP), an algorithm for which we derive finite-time regret upper bounds. In particular, we show that, for any expected reward function µ that behaves as µ(x) = µ(x ) − C|x − x | ξ locally around its maximizer x for some ξ, C > 0, the SP algorithm is order-optimal, i.e., its regret scales as O( T log(T )) when the time horizon T grows large. This regret scaling is achieved without the knowledge of ξ and C. Our algorithm is based on asymptotically optimal sequential statistical tests used to successively prune an interval that contains the best arm with high probability. To our knowledge, the SP algorithm constitutes the first sequential arm selection rule that achieves a regret scaling as O( √ T ) up to a logarithmic factor for non-smooth expected reward functions, as well as for smooth functions with unknown smoothness.
REF consider stochastic bandit problems with a continuous set of arms and where the expected reward is a continuous and unimodal function of the arm.
Unimodal Bandits without Smoothness
ArXiv
ArXiv
Mathematics Computer Science