# Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff

Ofer DekelRonen EldanTomer Koren

Bandit convex optimization is one of the fundamental problems in the field of online learning. The best algorithm for the general bandit convex optimization problem guarantees a regret of $\widetilde{O}(T^{5/6})$, while the best known lower bound is $\Omega(T^{1/2})$... (read more)

PDF Abstract

No code implementations yet. Submit your code now