Learning rotations with little regret
- Elad Hazan
- Satyen Kale
- et al.
- 2010
- COLT 2010
Conference paper
Publications
20 results for Satyen Kale
Extracting certainty from uncertainty: Regret bounded by variation in costs
- Elad Hazan
- Satyen Kale
- 2010
- Machine Learning
PaperO(√log n) approximation to sparsest cut in õ(n2) time
- Sanjeev Arora
- Elad Hazan
- et al.
- 2010
- SIAM Journal on Computing
PaperOnline submodular minimization
- Elad Hazan
- Satyen Kale
- 2009
- NeurIPS 2009
Conference paperOn stochastic and worst-case models for investing
- Elad Hazan
- Satyen Kale
- 2009
- NeurIPS 2009
Conference paperBetter algorithms for benign bandits
- Elad Hazan
- Satyen Kale
- 2009
- SODA 2009
Conference paperExtracting certainty from uncertainty: Regret bounded by variation in costs
- Elad Hazan
- Satyen Kale
- 2008
- COLT 2008
Conference paperComputational equivalence of fixed points and no regret algorithms, and convergence to equilibria
- Elad Hazan
- Satyen Kale
- 2007
- NeurIPS 2007
Conference paperLogarithmic regret algorithms for online convex optimization
- Elad Hazan
- Amit Agarwal
- et al.
- 2007
- Machine Learning
PaperEfficient aggregation algorithms for probabilistic data
- T.S. Jayram
- Satyen Kale
- et al.
- 2007
- SODA 2007
Conference paper