1 paper · 1 filter
Hidde Fokkema, Dirk van der Hoeven, Tor Lattimore +1
We introduce a computationally efficient algorithm for zeroth-order bandit convex optimisation and prove that in the adversarial setting its regret is at most $d^{3.5} \sqrt{n} \ma…