Kernel-based methods for bandit convex optimization

Sébastien Bubeck, Ronen Eldan, Yin Tat Lee

We consider the adversarial convex bandit problem and we build the first $\mathrm{poly}(T)$-time algorithm with $\mathrm{poly}(n)\sqrt{T}$-regret for this problem. To do so we int…