Efficient Online Bandit Multiclass Learning with Õ(√T) Regret

Alina Beygelzimer, Francesco Orabona, Chicheng Zhang

Abstract: We present an efficient second-order algorithm with $\tilde{O}(1/\eta \sqrt{T})$ regret for the bandit online multiclass problem. The regret bound holds simultaneously with respect to a family of l...