519 citations · 1.6k across the 49 of their papers we have counts for
4 papers · 1 filter
A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networks
Alexander Rakhlin, Karthik Sridharan
We revisit the elegant observation of T. Cover '65 which, perhaps, is not as well-known to the broader community as it should be. The first goal of the tutorial is to explain---thr…
Learning in Games: Robustness of Fast Convergence
Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris +2
We show that learning algorithms satisfying a property experience fast convergence to approximate optimality in a large class of repeated games. O…
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
Alexander Rakhlin, Karthik Sridharan
We present efficient algorithms for the problem of contextual bandits with i.i.d. covariates, an arbitrary sequence of rewards, and an arbitrary class of policies. Our algorithm BI…
Exploiting the Structure: Stochastic Gradient Methods Using Raw Clusters
Zeyuan Allen-Zhu, Yang Yuan, Karthik Sridharan
The amount of data available in the world is growing faster than our ability to deal with it. However, if we take advantage of the internal \emph{structure}, data may become much s…