119 citations · 149 across the 3 of their papers we have counts for
3 papers
cs.LG2011★ 119 cited
Efficient Optimal Learning for Contextual Bandits
Miroslav Dudik, Daniel Hsu, Satyen Kale +4
We address the problem of learning in an online setting where the learner repeatedly observes features, selects among a set of actions, and receives reward for the action taken. We…
cs.DS2010★ 13 cited
Combinatorial Approximation Algorithms for MaxCut using Random Walks
Satyen Kale, C. Seshadhri
We give the first combinatorial approximation algorithm for Maxcut that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, and…
math.OC2010★ 17 cited
An optimal algorithm for stochastic strongly-convex optimization
Elad Hazan, Satyen Kale
We consider stochastic convex optimization with a strongly convex (but not necessarily smooth) objective. We give an algorithm which performs only gradient updates with optimal rat…