Blake Woodworth
14 papers · 2017–2025 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (30)
ποΈ
Keyword Collector
(80)
π
Trend Setter
π
Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
β
The Questioner
Venues
Top co-authors
Research topics
Machine Learning
(12)
Optimization & Theory Β· Machine Learning
(10)
Mathematics & Optimization
(8)
Optimization
(7)
Deep Learning
(4)
Core Methods
(4)
Mathematics
(3)
Computer Science
(2)
Application Areas
(2)
Learning Types
(2)
Optimization & Theory Β· Deep Learning
(2)
Artificial Intelligence
(1)
Architectures
(1)
Core AI
(1)
Foundations
(1)
Keywords
convex optimization
(3)
gradient descent
(2)
local gradient descent
(2)
convergence rate
(2)
oracle complexity
(2)
stochastic gradient descent
(2)
heterogeneous data
(2)
computational complexity
(1)
fourier analysis
(1)
non-convex optimization
(1)
sample complexity
(1)
distributed optimization
(1)
function approximation
(1)
constrained optimization
(1)
algorithmic fairness
(1)
reproducing kernel hilbert space
(1)
statistical query
(1)
logistic regression
(1)
natural gradient
(1)
recursive regularization
(1)
Papers
Constant Stepsize Local GD for Logistic Regression: Acceleration by Instability
ICML 2025
Local Steps Speed Up Local GD for Heterogeneous Distributed Logistic Regression
ICLR 2025
Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy
ICML 2023
Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squares
COLT 2022
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication (Extended Abstract)
IJCAI 2022
Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent
AISTATS 2021
Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis
AISTATS 2020
Is Local SGD Better than Minibatch SGD?
ICML 2020
Kernel and Rich Regimes in Overparametrized Models
COLT 2020
The Gradient Complexity of Linear Regression
COLT 2020
Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory
COLT 2019
The Complexity of Making the Gradient Small in Stochastic Convex Optimization
COLT 2019
Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints
ICML 2019
Learning Non-Discriminatory Predictors
COLT 2017