Elad Hazan
Elad Hazan
Professor at Princeton University and Co-Director Google AI Princeton
Verified email at cs.princeton.edu - Homepage
TitleCited byYear
Adaptive subgradient methods for online learning and stochastic optimization
J Duchi, E Hazan, Y Singer
Journal of Machine Learning Research 12 (Jul), 2121-2159, 2011
Logarithmic regret algorithms for online convex optimization
E Hazan, A Agarwal, S Kale
Machine Learning 69 (2-3), 169-192, 2007
The multiplicative weights update method: a meta-algorithm and applications
S Arora, E Hazan, S Kale
Theory of Computing 8 (1), 121-164, 2012
Introduction to online convex optimization
E Hazan
Foundations and Trends® in Optimization 2 (3-4), 157-325, 2016
Competing in the dark: An efficient algorithm for bandit linear optimization
JD Abernethy, E Hazan, A Rakhlin
Variance reduction for faster non-convex optimization
Z Allen-Zhu, E Hazan
International conference on machine learning, 699-707, 2016
On the complexity of approximating k-set packing
E Hazan, S Safra, O Schwartz
computational complexity 15 (1), 20-39, 2006
Adaptive online gradient descent
E Hazan, A Rakhlin, PL Bartlett
Advances in Neural Information Processing Systems, 65-72, 2008
Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
E Hazan, S Kale
The Journal of Machine Learning Research 15 (1), 2489-2512, 2014
Sparse approximate solutions to semidefinite programs
E Hazan
Latin American symposium on theoretical informatics, 306-316, 2008
Algorithms for portfolio management based on the newton method
A Agarwal, E Hazan, S Kale, RE Schapire
Proceedings of the 23rd international conference on Machine learning, 9-16, 2006
Projection-free online learning
E Hazan, S Kale
arXiv preprint arXiv:1206.4657, 2012
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
E Hazan, S Kale
Proceedings of the 24th Annual Conference on Learning Theory, 421-436, 2011
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
S Arora, E Hazan, S Kale
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 339-348, 2005
Extracting certainty from uncertainty: Regret bounded by variation in costs
E Hazan, S Kale
Machine learning 80 (2-3), 165-188, 2010
10 the convex optimization approach to regret minimization
E Hazan
Optimization for machine learning, 287, 2012
O(\logn) Approximation to SPARSEST CUT in ̃O(n^2) Time
S Arora, E Hazan, S Kale
SIAM Journal on Computing 39 (5), 1748-1771, 2010
Efficient learning algorithms for changing environments
E Hazan, C Seshadhri
Proceedings of the 26th annual international conference on machine learning …, 2009
How hard is it to approximate the best Nash equilibrium?
E Hazan, R Krauthgamer
SIAM Journal on Computing 40 (1), 79-91, 2011
Finding approximate local minima faster than gradient descent
N Agarwal, Z Allen-Zhu, B Bullins, E Hazan, T Ma
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
The system can't perform the operation now. Try again later.
Articles 1–20