1.9k citations · 6.5k across the 132 of their papers we have counts for
Showing 2016 · math.OCShow all
2 papers · 2 filters
math.OC2016★ 49 cited
Tight Complexity Bounds for Optimizing Composite Objectives
Blake Woodworth, Nathan Srebro
We provide tight upper and lower bounds on the complexity of minimizing the average of convex functions using gradient and prox oracles of the component functions. We show a si…
math.OC2016★ 8 cited
On Data Dependence in Distributed Stochastic Optimization
Avleen S. Bijral, Anand D. Sarwate, Nathan Srebro
We study a distributed consensus-based stochastic gradient descent (SGD) algorithm and show that the rate of convergence involves the spectral properties of two matrices: the stand…