34 citations · 68 across the 7 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2018★ 22 cited
Faster Rates for Convex-Concave Games
Jacob Abernethy, Kevin A. Lai, Kfir Y. Levy +1
We consider the use of no-regret algorithms to compute equilibria for particular classes of convex-concave games. While standard regret bounds would lead to convergence rates on th…
cs.LG2015★ 6 cited
Label optimal regret bounds for online local learning
Pranjal Awasthi, Moses Charikar, Kevin A. Lai +1
We resolve an open question from (Christiano, 2014b) posed in COLT'14 regarding the optimal dependency of the regret achievable for online local learning on the size of the label s…