124 citations · 1.6k across the 112 of their papers we have counts for
Showing 2016 · math.OCShow all
3 papers · 2 filters
math.OC2016★ 10 cited
Finding Approximate Local Minima Faster than Gradient Descent
Naman Agarwal, Zeyuan Allen-Zhu, Brian Bullins +2
We design a non-convex second-order optimization algorithm that is guaranteed to return an approximate local minimum in time which scales linearly in the underlying dimension and t…
math.OC2016★ 119 cited
Variance Reduction for Faster Non-Convex Optimization
Zeyuan Allen-Zhu, Elad Hazan
We consider the fundamental problem in non-convex optimization of efficiently reaching a stationary point. In contrast to the convex case, in the long history of this basic problem…
math.OC2016★ 50 cited
Optimal Black-Box Reductions Between Optimization Objectives
Zeyuan Allen-Zhu, Elad Hazan
The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification ta…