The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme FP7/2007-2013/ under REA grant agreement n° [276840].

 

Conference Papers

• Elad Hazan, Roi Livni, Yishay Mansour (2015). Classification with Low Rank and Missing Data. (ICML 2015).
• Dan Garber, Elad Hazan (2015). Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets. (ICML 2015).
• Dan Garber, Elad Hazan, Tengyu Ma (2015). Online Learning of Eigenvectors. (ICML 2015).
• Oren Anava, Elad Hazan, Assaf Zeevi (2015). Online Time Series Prediction with Missing Data. (ICML 2015).
• Elad Hazan, Kfir Levy (2014). Bandit Convex Optimization: Towards Tight Bounds. (NIPS 2014).
• Ofer Dekel, Elad Hazan, Tomer Koren (2014). The Blinded Bandit: Learning with Adaptive Feedback. (NIPS 2014).
• Elad Hazan, Zohar Karnin, Raghu Meka (2014). Volumetric Spanners: an Efficient Exploration Basis for Learning. (COLT 2014).
• Elad Hazan, Tomer Koren, Kfir Levy (2014). Logistic Regression: Tight Bounds for Stochastic and Online Optimization. (COLT 2014).
• Elad Hazan, Zohar Karnin (2014). Hard-margin Active Linear Regression. (ICML 2014).
• Eshcar Hillel, Zohar Karnin, Tomer Koren, Ronny Lempel, Oren Somekh (2013). Distributed Exploration in Multi-Armed Bandits. (NIPS 2013).
• Zohar Karnin, Tomer Koren, Oren Somekh (2013). Almost Optimal Exploration in Multi-Armed Bandits. (ICML 2013)
• Dan Garber, Elad Hazan (2013). Playing Non-linear Games with Linear Oracles. 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013)
• Ofer Dekel, Elad Hazan (2013). Better Rates for Any Adversarial Deterministic MDPs. The 30th International Conference on Machine Learning (ICML 2013)
• Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir (2013). Online Learning for Time Series Prediction. The 26th conference on learning theory (COLT 2013)
• Elad Hazan, Zohar Karnin (2012). A Polylog Pivot Steps Simplex Algorithm for Classification. Twenty-Sixth Annual Conference on Neural Information Processing Systems (NIPS 2012)
• Elad Hazan, Tomer Koren (2012). Linear Regression with Limited Observation. The 29th International Conference on Machine Learning (ICML 2012) ICML 2012 Best Student Paper Runner Up
• Elad Hazan, Satyen Kale (2012). Projection-free Online Learning. The 29th International Conference on Machine Learning (ICML 2012)
• Elad Hazan, Sham Kakade (2012). (weak) Calibration is Computationally Hard. The 25th conference on learning theory (COLT 2012)
• Elad Hazan, Satyen Kale, Shai Shalev-Shwartz (2012). Near-Optimal Algorithms for Online Matrix Prediction. The 25th conference on learning theory (COLT 2012)
• Elad Hazan, Satyen Kale (2011). Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction. Advances in Neural Information Processing Systems (NIPS)
• Elad Hazan, Tomer Koren, Nathan Srebro (2011). Beating SGD: Learning SVMs in Sublinear Time. Advances in Neural Information Processing Systems (NIPS)
• Dan Garber, Elab Hazan (2011). Approximating Semidefinite Programs in Sublinear Time. Advances in Neural Information Processing Systems (NIPS) 24 2011

 

Journal Articles

• Elad Hazan, Satyen Kale (2014). Beyond the Regret Minimization Barrier: Optimal Algorithms for Stochastic Strongly-Convex Optimization Journal of Machine Learning Research 15 (pp. 2489-2512).
• Dan Garber, Elad Hazan (2013). Adaptive Universal Linear Filtering IEEE Transactions on Signal Processing (pp. 1595-1604).
• Keneth L. Clarkson, Elad Hazan, David P. Woodruff (2012). Sublinear Optimization for Machine Learning. Journal of the ACM (JACM), Volume 59 Issue 5, October 2012. IBM 2012 Pat Goldberg Memorial Best Paper Award
• Elad Hazan, Satyen Kale (2012). Online Submodular Minimization. Journal of Machine Learning Research (JMLR) 13 (pp. 2903-2922).
• Sanjeev Arora, Elad Hazan, Satyen Kale (2012). The Multiplicative Weights Update Method: A Meta-Algorithm and Applications. Theory of Computing, Volume 8 (2012) Article 6 (pp. 121-164).
• Jhon Duchi, Elad Hazan, Yoram Singer (2011). Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. Journal of Machine Learning Research (JMLR) Volume 12 (pp. 2121-2159) .
• Elad Hazan, Satyen Kale (2011). On Stochastic and Worst-case Models for Investing. To appear in Mathematical Finance.
• Elad Hazan, Robert Krauthgamer (2011). How hard is it to approximate the best Nash equilibrium? SIAM Journal on Computing (SICOMP) 40(1) (pp. 79-91) .
• Elad Hazan, Satyen Kale (2011). Better Algorithms for Benign Bandits. Journal of Machine Learning Research (JMLR) 12, (pp. 1287-1311).