journalarticle
Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff
Neural Information Processing Systems2015-12-07 36 citations17 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis work presents an efficient algorithm for the bandit smooth convex optimization problem that guarantees a regret of O(T5/8), which rules out an Ω(T2/3) lower bound and takes a significant step towards the resolution of this open problem. (Semantic Scholar)