4 citations · 4 across the 1 of their papers we have counts for
1 paper
Nicolò Cesa-Bianchi, Sham Kakade
We provide the first algorithm for online bandit linear optimization whose regret after T rounds is of order sqrt{Td ln N} on any finite class X of N actions in d dimensions, and o…