160 citations · 1.5k across the 122 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…
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Ankan Saha, Ambuj Tewari
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stabi…