On-line variance minimization in O(n2) per trial?
- Elad Hazan
- Satyen Kale
- et al.
- 2010
- COLT 2010
Publications
Date
Featured collections
Popular topics
20 results for Elad Hazan
Sublinear optimization for machine learning
- Kenneth L. Clarkson
- Elad Hazan
- et al.
- 2010
- FOCS 2010
How hard is it to approximate the best Nash equilibrium?
- Elad Hazan
- Robert Krauthgamer
- 2009
- SODA 2009
Better algorithms for benign bandits
- Elad Hazan
- Satyen Kale
- 2009
- SODA 2009
Competing in the dark: An efficient algorithm for bandit linear optimization
- Jacob Abernethy
- Elad Hazan
- et al.
- 2008
- COLT 2008
Extracting certainty from uncertainty: Regret bounded by variation in costs
- Elad Hazan
- Satyen Kale
- 2008
- COLT 2008
Extracting certainty from uncertainty: Regret bounded by variation in costs
- Elad Hazan
- Satyen Kale
- 2010
- Machine Learning
Logarithmic regret algorithms for online convex optimization
- Elad Hazan
- Amit Agarwal
- et al.
- 2007
- Machine Learning
An Online Portfolio Selection Algorithm With Regret Logarithmic In Price Variation
- Elad Hazan
- Satyen Kale
- 2012
- Mathematical Finance
O(√log n) approximation to sparsest cut in õ(n2) time
- Sanjeev Arora
- Elad Hazan
- et al.
- 2010
- SIAM Journal on Computing