12 citations · 23 across the 3 of their papers we have counts for
3 papers
cs.LG2010★ 12 cited
Blackwell Approachability and Low-Regret Learning are Equivalent
Jacob Abernethy, Peter L. Bartlett, Elad Hazan
We consider the celebrated Blackwell Approachability Theorem for two-player games with vector payoffs. We show that Blackwell's result is equivalent, via efficient reductions, to t…
cs.LG2010
Sublinear Optimization for Machine Learning
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclosing balls.…
cs.DS2006★ 11 cited
Approximate Convex Optimization by Online Game Playing
Elad Hazan
Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a app…