519 citations · 1.6k across the 49 of their papers we have counts for
3 papers · 1 filter
Small-loss bounds for online learning with partial information
Thodoris Lykouris, Karthik Sridharan, Eva Tardos
We consider the problem of adversarial (non-stochastic) online learning with partial information feedback, where at each round, a decision maker selects an action from a finite set…
ZigZag: A new approach to adaptive online learning
Dylan J. Foster, Alexander Rakhlin, Karthik Sridharan
We develop a novel family of algorithms for the online learning setting with regret against any data sequence bounded by the empirical Rademacher complexity of that sequence. To de…
Inference in Sparse Graphs with Pairwise Measurements and Side Information
Dylan J. Foster, Daniel Reichman, Karthik Sridharan
We consider the statistical problem of recovering a hidden "ground truth" binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurement…