Elad Hazan, machine learning & optimization

Home . Bio . Publications . Teaching


	Elad Hazan ehazan@ie.technion.ac.il Technion - Israel Institute of Technology Haifa, Israel

I'm a faculty member at the Faculty of IE&M of the Technion, Israel Institute of Technology. I'm interested in designing efficient algorithms for fundamental problems in machine learning and optimization. Most of my research can be classified under "machine learning", though I'm also interested in convex optimization, game theory and computational complexity. Teaching Graduate Students: Oren Anava (Ph.D), Dan Garber (Ph.D), Tomer Koren (Ph.D) Information for prospective students. Selected Publications Sublinear Optimization for Machine Learning. (with K. Clarkson and D. Woodruff). Journal of the ACM (JACM), Volume 59 Issue 5, October 2012 preliminary version in (FOCS 2010). On Stochastic and Worst-case Models for Investing. (with Satyen Kale) To appear in Mathematical Finance preliminary version in (NIPS 2009). An Efficient Algorithm for Bandit Linear Optimization. (with Jacob Abernethy and Alexander Rakhlin) IEEE Transactions on Information Theory 58(7): 4164-4175 (2012) Preliminary version in (COLT 2008). IBM 2008 Pat Goldberg Memorial Best Paper Award Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. (with Satyen Kale) Machine Learning: Volume 80, Issue 2 (2010), Page 165. (COLT special issue) Preliminary version appeared in The 21st Annual Conference on Learning Theory (COLT 2008). Logarithmic Regret Algorithms for Online Convex Optimization. (with Amit Agarwal and Satyen Kale) In Machine Learning Journal Volume 69 , Issue 2-3 Pages: 169 - 192 (December 2007). Survey (appeared as a book chapter): The convex optimization approach to regret minimization.