Timezone: »

 
Poster
Adaptive Proximal Gradient Methods for Structured Neural Networks
Jihun Yun · Aurelie Lozano · Eunho Yang

Fri Dec 10 08:30 AM -- 10:00 AM (PST) @
in Poster Session 8 »

We consider the training of structured neural networks where the regularizer can be non-smooth and possibly non-convex. While popular machine learning libraries have resorted to stochastic (adaptive) subgradient approaches, the use of proximal gradient methods in the stochastic setting has been little explored and warrants further study, in particular regarding the incorporation of adaptivity. Towards this goal, we present a general framework of stochastic proximal gradient descent methods that allows for arbitrary positive preconditioners and lower semi-continuous regularizers. We derive two important instances of our framework: (i) the first proximal version of \textsc{Adam}, one of the most popular adaptive SGD algorithm, and (ii) a revised version of ProxQuant for quantization-specific regularizers, which improves upon the original approach by incorporating the effect of preconditioners in the proximal mapping computations. We provide convergence guarantees for our framework and show that adaptive gradient methods can have faster convergence in terms of constant than vanilla SGD for sparse data. Lastly, we demonstrate the superiority of stochastic proximal methods compared to subgradient-based approaches via extensive experiments. Interestingly, our results indicate that the benefit of proximal approaches over sub-gradient counterparts is more pronounced for non-convex regularizers than for convex ones.

Keywords: Deep Learning · Optimization · Machine Learning

Author Information

Jihun Yun (Korea Advanced Institute of Science and Technology)
Aurelie Lozano (IBM Research)
Eunho Yang (Korea Advanced Institute of Science and Technology; AItrics)

More from the Same Authors