519 citations · 1.6k across the 49 of their papers we have counts for
3 papers · 1 filter
Optimistic Rates for Learning with a Smooth Loss
Nathan Srebro, Karthik Sridharan, Ambuj Tewari
We establish an excess risk bound of O(H R_n^2 + R_n \sqrt{H L*}) for empirical risk minimization with an H-smooth loss function and a hypothesis class with Rademacher complexity R…
Online Learning via Sequential Complexities
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful…
Learning Kernel-Based Halfspaces with the Zero-One Loss
Shai Shalev-Shwartz, Ohad Shamir, Karthik Sridharan
We describe and analyze a new algorithm for agnostically learning kernel-based halfspaces with respect to the \emph{zero-one} loss function. Unlike most previous formulations which…