activity
20102024
most citedMaking Gradient Descent Optimal for Strongly Convex Stochastic Optimization

519 citations · 1.6k across the 49 of their papers we have counts for

collaborators
Showing stat.MLShow all

6 papers · 1 filter

stat.ML2015

Private Causal Inference

Matt J. Kusner, Yu Sun, Karthik Sridharan +1

Causal inference deals with identifying which random variables "cause" or control other random variables. Recent advances on the topic of causal inference based on tools from stati…

stat.ML2015★ 24 cited

Learning with Square Loss: Localization through Offset Rademacher Complexity

Tengyuan Liang, Alexander Rakhlin, Karthik Sridharan

We consider regression with square loss and general classes of functions without the boundedness assumption. We introduce a notion of offset Rademacher complexity that provides a t…

stat.ML2015★ 8 cited

Online Nonparametric Regression with General Loss Functions

Alexander Rakhlin, Karthik Sridharan

This paper establishes minimax rates for online regression with arbitrary classes of functions and general losses. We show that below a certain threshold for the complexity of the…

stat.ML2013★ 1 cited

Competing With Strategies

Wei Han, Alexander Rakhlin, Karthik Sridharan

We study the problem of online learning with a notion of regret defined with respect to a set of strategies. We develop tools for analyzing the minimax rates and for deriving regre…

stat.ML2012★ 130 cited

Online Learning with Predictable Sequences

Alexander Rakhlin, Karthik Sridharan

We present methods for online linear optimization that take advantage of benign (as opposed to worst-case) sequences. Specifically if the sequence encountered by the learner is des…

stat.ML2011★ 12 cited

Online Learning: Stochastic and Constrained Adversaries

Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari

Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and th…