-
IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method
We introduce a framework for designing primal methods under the decentra...
06/11/2020 ∙ by Yossi Arjevani, et al. ∙
0
∙
share
read it
-
Stochastic Optimization with Non-stationary Noise
We investigate stochastic optimization problems under relaxed assumption...
06/08/2020 ∙ by Jingzhao Zhang, et al. ∙
0
∙
share
read it
-
On Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions
We provide the first non-asymptotic analysis for finding stationary poin...
02/10/2020 ∙ by Jingzhao Zhang, et al. ∙
0
∙
share
read it
-
On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions
Recent advances in randomized incremental methods for minimizing L-smoot...
02/09/2020 ∙ by Yossi Arjevani, et al. ∙
5
∙
share
read it
-
ResNet with one-neuron hidden layers is a Universal Approximator
We demonstrate that a very deep ResNet with stacked modules with one neu...
06/28/2018 ∙ by Hongzhou Lin, et al. ∙
10
∙
share
read it
-
Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
We introduce a generic scheme for accelerating gradient-based optimizati...
12/15/2017 ∙ by Hongzhou Lin, et al. ∙
0
∙
share
read it
-
Catalyst Acceleration for Gradient-Based Non-Convex Optimization
We introduce a generic scheme to solve nonconvex optimization problems u...
03/31/2017 ∙ by Courtney Paquette, et al. ∙
0
∙
share
read it
-
A Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization
We propose a generic approach to accelerate gradient-based optimization ...
10/04/2016 ∙ by Hongzhou Lin, et al. ∙
0
∙
share
read it
