Competing in the dark: An efficient algorithm for bandit linear optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O*(√T)regret. The setting is a natural general...