124 citations · 1.6k across the 112 of their papers we have counts for
12 papers · 1 filter
The Nonstochastic Control Problem
Elad Hazan, Sham M. Kakade, Karan Singh
We consider the problem of controlling an unknown linear dynamical system in the presence of (nonstochastic) adversarial perturbations and adversarial convex loss functions. In con…
The gradient complexity of linear regression
Mark Braverman, Elad Hazan, Max Simchowitz +1
We investigate the computational complexity of several basic linear algebra primitives, including largest eigenvector computation and linear regression, in the computational model…
Logarithmic Regret for Online Control
Naman Agarwal, Elad Hazan, Karan Singh
We study optimal regret bounds for control in linear dynamical systems under adversarially changing strongly convex cost functions, given the knowledge of transition dynamics. This…
Lecture Notes: Optimization for Machine Learning
Elad Hazan
Lecture notes on optimization for machine learning, derived from a course at Princeton University and tutorials given in MLSS, Buenos Aires, as well as Simons Foundation, Berkeley.
Introduction to Online Convex Optimization
Elad Hazan
This manuscript portrays optimization as a process. In many practical applications the environment is so complex that it is infeasible to lay out a comprehensive theoretical model…
Private Learning Implies Online Learning: An Efficient Reduction
Alon Gonen, Elad Hazan, Shay Moran
We study the relationship between the notions of differentially private learning and online learning in games. Several recent works have shown that differentially private learning…