☰

Elad Hazan - Publications

Affiliations: 
Computer Science Princeton University, Princeton, NJ 
Tree Info Similar researchers PubMed Report error

40 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Garber D, Hazan E. A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization Siam Journal On Optimization. 26: 1493-1528. DOI: 10.1137/140985366  0.474
2016 Hazan E, Kale S, Warmuth MK. Learning rotations with little regret Machine Learning. 1-20. DOI: 10.1007/S10994-016-5548-X  0.483
2015 Hazan E, Kale S. An Online Portfolio Selection Algorithm With Regret Logarithmic In Price Variation Mathematical Finance. 25: 288-310. DOI: 10.1111/Mafi.12006  0.478
2015 Hazan E, Koren T. A linear-time algorithm for trust region problems Mathematical Programming. DOI: 10.1007/S10107-015-0933-Y  0.466
2015 Garber D, Hazan E. Sublinear time algorithms for approximate semidefinite programming Mathematical Programming. DOI: 10.1007/S10107-015-0932-Z  0.521
2015 Beygelzimer A, Hazan E, Kale S, Luo H. Online gradient boosting Advances in Neural Information Processing Systems. 2015: 2458-2466.  0.378
2015 Hazan E, Levy KY, Shalev-Shwartz S. Beyond convexity: Stochastic quasi-convex optimization Advances in Neural Information Processing Systems. 2015: 1594-1602.  0.374
2015 Anava O, Hazan E, Mannor S. Online learning for adversaries with memory: Price of past mistakes Advances in Neural Information Processing Systems. 2015: 784-792.  0.326
2014 Hazan E, Karnin Z, Meka R. Volumetric spanners: An efficient exploration basis for learning Journal of Machine Learning Research. 35: 408-422.  0.334
2014 Dekel O, Hazan E, Koren T. The blinded bandit: Learning with adaptive feedback Advances in Neural Information Processing Systems. 2: 1610-1618.  0.358
2014 Hazan E, Kale S. Beyond the regret minimization barrier: Optimal algorithms for stochastic strongly-convex optimization Journal of Machine Learning Research. 15: 2489-2512.  0.321
2013 Garber D, Hazan E. Adaptive universal linear filtering Ieee Transactions On Signal Processing. 61: 1595-1604. DOI: 10.1109/Tsp.2012.2234742  0.321
2013 Dekel O, Hazan E. Better rates for any adversarial deterministic MDP 30th International Conference On Machine Learning, Icml 2013. 1712-1720.  0.315
2012 Arora S, Hazan E, Kale S. The Multiplicative Weights Update Method: A Meta-Algorithm and Applications Theory of Computing. 8: 121-164. DOI: 10.4086/Toc.2012.V008A006  0.563
2012 Clarkson KL, Hazan E, Woodruff DP. Sublinear optimization for machine learning Journal of the Acm. 59. DOI: 10.1145/2371656.2371658  0.516
2012 Abernethy JD, Hazan E, Rakhlin A. Interior-point methods for full-information and bandit online learning Ieee Transactions On Information Theory. 58: 4164-4175. DOI: 10.1109/Tit.2012.2192096  0.447
2012 Hazan E, Koren T. Linear regression with limited observation Proceedings of the 29th International Conference On Machine Learning, Icml 2012. 1: 807-814.  0.341
2012 Hazan E, Kakade S. (Weak) calibration is computationally hard Journal of Machine Learning Research. 23: 3.1-3.10.  0.408
2012 Hazan E, Kale S. Online submodular minimization Journal of Machine Learning Research. 13: 2903-2922.  0.323
2012 Hazan E, Karnin Z. A provably efficient simplex algorithm for classification Advances in Neural Information Processing Systems. 1: 629-637.  0.346
2012 Hazan E, Kale S. Projection-free online learning Proceedings of the 29th International Conference On Machine Learning, Icml 2012. 1: 521-528.  0.359
2012 Hazan E, Kale S, Shalev-Shwartz S. Near-optimal algorithms for online matrix prediction Journal of Machine Learning Research. 23: 38.1-38.13.  0.309
2011 Hazan E, Krauthgamer R. How hard is it to approximate the best nash equilibrium? Siam Journal On Computing. 40: 79-91. DOI: 10.1137/090766991  0.446
2011 Hazan E, Kale S. Better algorithms for benign bandits Journal of Machine Learning Research. 12: 1287-1311.  0.328
2011 Hazan E, Kale S. NEWTRON: An efficient bandit algorithm for online multiclass prediction Advances in Neural Information Processing Systems 24: 25th Annual Conference On Neural Information Processing Systems 2011, Nips 2011.  0.307
2011 Hazan E, Kale S. A simple multi-armed bandit algorithm with optimal variation-bounded regret Journal of Machine Learning Research. 19: 817-819.  0.393
2011 Hazan E, Kale S. Beyond the regret minimization barrier: An optimal algorithm for stochastic strongly-convex optimization Journal of Machine Learning Research. 19: 421-436.  0.346
2011 Garber D, Hazan E. Approximating semidefinite programs in sublinear time Advances in Neural Information Processing Systems 24: 25th Annual Conference On Neural Information Processing Systems 2011, Nips 2011.  0.45
2010 Arora S, Hazan E, Kale S. O(√log n) approximation to sparsest cut in õ(n2) time Siam Journal On Computing. 39: 1748-1771. DOI: 10.1137/080731049  0.535
2010 Hazan E, Kale S. Extracting certainty from uncertainty: Regret bounded by variation in costs Machine Learning. 80: 165-188. DOI: 10.1007/S10994-010-5175-X  0.423
2009 Hazan E, Seshadhri C. Efficient learning algorithms for changing environments Proceedings of the 26th International Conference On Machine Learning, Icml 2009. 393-400. DOI: 10.1145/1553374.1553425  0.421
2009 Hazan E, Kale S. Computational equivalence of fixed points and no regret algorithms, and convergence to equilibria Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference.  0.42
2008 Hazan E. Sparse approximate solutions to semidefinite programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4957: 306-316. DOI: 10.1007/978-3-540-78773-0_27  0.361
2008 Abernethy J, Hazan E, Rakhlin A. Competing in the dark: An efficient algorithm for bandit linear optimization 21st Annual Conference On Learning Theory, Colt 2008. 263-273.  0.39
2007 Hazan E, Agarwal A, Kale S. Logarithmic regret algorithms for online convex optimization Machine Learning. 69: 169-192. DOI: 10.1007/S10994-007-5016-8  0.486
2006 Halperin E, Hazan E. HAPLOFREQ--estimating haplotype frequencies efficiently. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 13: 481-500. PMID 16597253 DOI: 10.1089/Cmb.2006.13.481  0.37
2006 Agarwal A, Hazan E, Kale S, Schapire RE. Algorithms for portfolio management based on the Newton method Acm International Conference Proceeding Series. 148: 9-16. DOI: 10.1145/1143844.1143846  0.426
2006 Arora S, Hazan E, Kale S. A fast random sampling algorithm for sparsifying matrices Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4110: 272-279.  0.3
2005 Arora S, Hazan E, Kale S. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2005: 339-348. DOI: 10.1109/SFCS.2005.35  0.42
2004 Arora S, Hazan E, Kale S. O(√log n) approximation to SPARSEST CUT in Õ(n 2) time Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 238-247.  0.384
Show low-probability matches.