Stochastic Proximal Gradient Algorithm with Minibatches. Application to Large Scale Learning Models
arXiv:2003.13332
Abstract
Stochastic optimization lies at the core of most statistical learning models. The recent great development of stochastic algorithmic tools focused significantly onto proximal gradient iterations, in order to find an efficient approach for nonsmooth (composite) population risk functions. The complexity of finding optimal predictors by minimizing regularized risk is largely understood for simple regularizations such as norms. However, more complex properties desired for the predictor necessitates highly difficult regularizers as used in grouped lasso or graph trend filtering. In this chapter we develop and analyze minibatch variants of stochastic proximal gradient algorithm for general composite objective functions with stochastic nonsmooth components. We provide iteration complexity for constant and variable stepsize policies obtaining that, for minibatch size , after iterations suboptimality is attained in expected quadratic distance to optimal solution. The numerical tests on regularized SVMs and parametric sparse representation problems confirm the theoretical behaviour and surpasses minibatch SGD performance.
References in corpus (9)
- Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour
- Train longer, generalize better: closing the generalization gap in large batch training of neural networks
- Network Lasso: Clustering and Optimization in Large Graphs
- SGD and Hogwild! Convergence Without the Bounded Gradients Assumption
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Vector-Valued Graph Trend Filtering with Non-Convex Penalties
- Memory and Communication Efficient Distributed Stochastic Optimization with Minibatch-Prox
- Random minibatch subgradient algorithms for convex problems with functional constraints
- Stochastic Nonconvex Optimization with Large Minibatches