15 citations · 15 across the 1 of their papers we have counts for
3 papers
cs.LG2018
Online Improper Learning with an Approximation Oracle
Elad Hazan, Wei Hu, Yuanzhi Li +1
We revisit the question of reducing online learning to approximate optimization of the offline problem. In this setting, we give two algorithms with near-optimal performance in the…
cs.LG2017★ 15 cited
Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls
Zeyuan Allen-Zhu, Elad Hazan, Wei Hu +1
We propose a rank- variant of the classical Frank-Wolfe algorithm to solve convex optimization over a trace-norm ball. Our algorithm replaces the top singular-vector computation…
cs.LG2016
An optimal algorithm for bandit convex optimization
Elad Hazan, Yuanzhi Li
We consider the problem of online convex optimization against an arbitrary adversary with bandit feedback, known as bandit convex optimization. We give the first $\tilde{O}(\sqrt{T…