
-
Online learning with dynamics: A minimax perspective
We study the problem of online learning with dynamics, where a learner i...
read it
-
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations
We design an algorithm which finds an ϵ-approximate stationary point (wi...
read it
-
Reinforcement Learning with Feedback Graphs
We study episodic reinforcement learning in Markov decision processes wh...
read it
-
Hypothesis Set Stability and Generalization
We present an extensive study of generalization for data-dependent hypot...
read it
-
Distributed Learning with Sublinear Communication
In distributed statistical learning, N samples are split across m machin...
read it
-
The Complexity of Making the Gradient Small in Stochastic Convex Optimization
We give nearly matching upper and lower bounds on the oracle complexity ...
read it
-
Uniform Convergence of Gradients for Non-Convex Learning and Optimization
We investigate 1) the rate at which refined properties of the empirical ...
read it
-
Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
We show that many machine learning goals, such as improved fairness metr...
read it
-
Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints
Classifiers can be trained with data-dependent constraints to satisfy fa...
read it
-
Two-Player Games for Efficient Non-Convex Constrained Optimization
In recent years, constrained optimization has become increasingly releva...
read it
-
Logistic Regression: The Importance of Being Improper
Learning linear predictors with the logistic loss---both in stochastic a...
read it
-
Online Learning: Sufficient Statistics and the Burkholder Method
We uncover a fairly general principle in online learning: If regret can ...
read it
-
Small-loss bounds for online learning with partial information
We consider the problem of adversarial (non-stochastic) online learning ...
read it
-
ZigZag: A new approach to adaptive online learning
We develop a novel family of algorithms for the online learning setting ...
read it
-
A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networks
We revisit the elegant observation of T. Cover '65 which, perhaps, is no...
read it
-
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
We present efficient algorithms for the problem of contextual bandits wi...
read it
-
Exploiting the Structure: Stochastic Gradient Methods Using Raw Clusters
The amount of data available in the world is growing faster than our abi...
read it
-
Private Causal Inference
Causal inference deals with identifying which random variables "cause" o...
read it
-
On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities
We study an equivalence of (i) deterministic pathwise statements appeari...
read it
-
Adaptive Online Learning
We propose a general framework for studying adaptive regret bounds in th...
read it
-
Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints
We study online prediction where regret of the algorithm is measured aga...
read it
-
Learning with Square Loss: Localization through Offset Rademacher Complexity
We consider regression with square loss and general classes of functions...
read it
-
Sequential Probability Assignment with Binary Alphabets and Large Classes of Experts
We analyze the problem of sequential probability assignment for binary o...
read it
-
Online Nonparametric Regression with General Loss Functions
This paper establishes minimax rates for online regression with arbitrar...
read it
-
Online Optimization : Competing with Dynamic Comparators
Recent literature on online learning has focused on developing adaptive ...
read it
-
Online Nonparametric Regression
We establish optimal rates for online regression for arbitrary classes o...
read it
-
Competing With Strategies
We study the problem of online learning with a notion of regret defined ...
read it
-
Online Learning with Predictable Sequences
We present methods for online linear optimization that take advantage of...
read it
-
Minimizing The Misclassification Error Rate Using a Surrogate Convex Loss
We carefully study how well minimizing convex surrogate loss functions, ...
read it
-
Relax and Localize: From Value to Algorithms
We show a principled way of deriving online learning algorithms from a m...
read it
-
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The ...
read it
-
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the ...
read it
-
Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity
The versatility of exponential families, along with their attendant conv...
read it