555 citations · 2.5k across the 105 of their papers we have counts for
3 papers · 2 filters
A Distributed Cubic-Regularized Newton Method for Smooth Convex Optimization over Networks
César A. Uribe, Ali Jadbabaie
We propose a distributed, cubic-regularized Newton method for large-scale convex optimization over networks. The proposed method requires only local computations and communications…
Beyond Worst-Case Analysis in Stochastic Approximation: Moment Estimation Improves Instance Complexity
Jingzhao Zhang, Hongzhou Lin, Subhro Das +2
We study oracle complexity of gradient based methods for stochastic approximation problems. Though in many settings optimal algorithms and tight lower bounds are known for such pro…
Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions
Jingzhao Zhang, Hongzhou Lin, Stefanie Jegelka +2
We provide the first non-asymptotic analysis for finding stationary points of nonsmooth, nonconvex functions. In particular, we study the class of Hadamard semi-differentiable func…