Tight Complexity Bounds for Optimizing Composite Objectives. - Blake E. Woodworth; Nati Srebro (NIPS, 2016)

Learning Non-Discriminatory Predictors. - Blake E. Woodworth; Suriya Gunasekar; Mesrob I. Ohannessian; Nathan Srebro (COLT, 2017)

Implicit Regularization in Matrix Factorization. - Suriya Gunasekar; Blake E. Woodworth; Srinadh Bhojanapalli; Behnam Neyshabur; Nati Srebro (NIPS, 2017)

The Everlasting Database: Statistical Validity at a Fair Price. - Blake E. Woodworth; Vitaly Feldman; Saharon Rosset; Nati Srebro (NeurIPS, 2018)

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization. - Blake E. Woodworth; Jialei Wang; Adam D. Smith 001; Brendan McMahan; Nati Srebro (NeurIPS, 2018)

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization. - Blake E. Woodworth; Jialei Wang; Brendan McMahan; Nathan Srebro (CoRR, 2018)

The Complexity of Making the Gradient Small in Stochastic Convex Optimization. - Dylan J. Foster; Ayush Sekhari; Ohad Shamir; Nathan Srebro; Karthik Sridharan; Blake E. Woodworth (COLT, 2019)

Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory. - Blake E. Woodworth; Nathan Srebro (COLT, 2019)

Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints. - Andrew Cotter; Maya R. Gupta; Heinrich Jiang; Nathan Srebro; Karthik Sridharan; Serena Lutong Wang; Blake E. Woodworth; Seungil You (ICML, 2019)

Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis. - Ryan Rogers 002; Aaron Roth 001; Adam D. Smith 001; Nathan Srebro; Om Thakkar 001; Blake E. Woodworth (AISTATS, 2020)

The Gradient Complexity of Linear Regression. - Mark Braverman; Elad Hazan; Max Simchowitz; Blake E. Woodworth (COLT, 2020)

Kernel and Rich Regimes in Overparametrized Models. - Blake E. Woodworth; Suriya Gunasekar; Jason D. Lee; Edward Moroshko; Pedro Savarese; Itay Golan; Daniel Soudry; Nathan Srebro (COLT, 2020)

Is Local SGD Better than Minibatch SGD? - Blake E. Woodworth; Kumar Kshitij Patel; Sebastian U. Stich; Zhen Dai; Brian Bullins; H. Brendan McMahan; Ohad Shamir; Nathan Srebro (ICML, 2020)

Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracy. - Edward Moroshko; Blake E. Woodworth; Suriya Gunasekar; Jason D. Lee; Nati Srebro; Daniel Soudry (NeurIPS, 2020)

Minibatch vs Local SGD for Heterogeneous Distributed Learning. - Blake E. Woodworth; Kumar Kshitij Patel; Nati Srebro (NeurIPS, 2020)

Mirrorless Mirror Descent: A More Natural Discretization of Riemannian Gradient Flow. - Suriya Gunasekar; Blake E. Woodworth; Nathan Srebro (CoRR, 2020)

Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent. - Suriya Gunasekar; Blake E. Woodworth; Nathan Srebro (AISTATS, 2021)

The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication. - Blake E. Woodworth; Brian Bullins; Ohad Shamir; Nathan Srebro (COLT, 2021)

On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descent. - Shahar Azulay; Edward Moroshko; Mor Shpigel Nacson; Blake E. Woodworth; Nathan Srebro; Amir Globerson; Daniel Soudry (ICML, 2021)

A Stochastic Newton Algorithm for Distributed Convex Optimization. - Brian Bullins; Kumar Kshitij Patel; Ohad Shamir; Nathan Srebro; Blake E. Woodworth (NeurIPS, 2021)

An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning. - Blake E. Woodworth; Nathan Srebro (NeurIPS, 2021)

A Field Guide to Federated Optimization. - Jianyu Wang; Zachary Charles; Zheng Xu 002; Gauri Joshi; H. Brendan McMahan; Blaise Agüera y Arcas; Maruan Al-Shedivat; Galen Andrew; Salman Avestimehr; Katharine Daly; Deepesh Data; Suhas N. Diggavi; et al. (CoRR, 2021)

The Minimax Complexity of Distributed Optimization. - Blake E. Woodworth (CoRR, 2021)

Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squares. - Blake E. Woodworth; Francis R. Bach; Alessandro Rudi (COLT, 2022)

The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication (Extended Abstract). - Blake E. Woodworth; Brian Bullins; Ohad Shamir; Nathan Srebro (IJCAI, 2022)

Asynchronous SGD Beats Minibatch SGD Under Arbitrary Delays. - Konstantin Mishchenko; Francis R. Bach; Mathieu Even; Blake E. Woodworth (NeurIPS, 2022)

Towards Optimal Communication Complexity in Distributed Non-Convex Optimization. - Kumar Kshitij Patel; Lingxiao Wang; Blake E. Woodworth; Brian Bullins; Nati Srebro (NeurIPS, 2022)

Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy. - Blake E. Woodworth; Konstantin Mishchenko; Francis R. Bach (ICML, 2023)

Lower bounds for non-convex stochastic optimization. - Yossi Arjevani; Yair Carmon; John C. Duchi; Dylan J. Foster; Nathan Srebro; Blake E. Woodworth (Math. Program., 2023)