Extracting certainty from uncertainty: Regret bounded by variation in costsElad HazanSatyen Kale2010Machine Learning
O(√log n) approximation to sparsest cut in õ(n2) timeSanjeev AroraElad Hazanet al.2010SIAM Journal on Computing
Extracting certainty from uncertainty: Regret bounded by variation in costsElad HazanSatyen Kale2008COLT 2008
Computational equivalence of fixed points and no regret algorithms, and convergence to equilibriaElad HazanSatyen Kale2007NeurIPS 2007
Logarithmic regret algorithms for online convex optimizationElad HazanAmit Agarwalet al.2007Machine Learning