38 citations · 48 across the 4 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LG2012★ 38 cited
Near-Optimal Algorithms for Online Matrix Prediction
Elad Hazan, Satyen Kale, Shai Shalev-Shwartz
In several online prediction problems of recent interest the comparison class is composed of matrices with bounded entries. For example, in the online max-cut problem, the comparis…
cs.GT2012★ 6 cited
(weak) Calibration is Computationally Hard
Elad Hazan, Sham Kakade
We show that the existence of a computationally efficient calibration algorithm, with a low weak calibration rate, would imply the existence of an efficient algorithm for computing…