124 citations · 1.6k across the 112 of their papers we have counts for
3 papers · 1 filter
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…
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.…
An optimal algorithm for stochastic strongly-convex optimization
Elad Hazan, Satyen Kale
We consider stochastic convex optimization with a strongly convex (but not necessarily smooth) objective. We give an algorithm which performs only gradient updates with optimal rat…