Stochastic proximal splitting algorithm for stochastic composite minimization

12/04/2019
by   Andrei Patrascu, et al.
0

Supported by the recent contributions in multiple branches, the first-order splitting algorithms became central for structured nonsmooth optimization. In the large-scale or noisy contexts, when only stochastic information on the smooth part of the objective function is available, the extension of proximal gradient schemes to stochastic oracles is based on proximal tractability of the nonsmooth component and it has been deeply analyzed in the literature. However, there remained gaps illustrated by composite models where the nonsmooth term is not proximally tractable anymore. In this note we tackle composite optimization problems, where the access only to stochastic information on both smooth and nonsmooth components is assumed, using a stochastic proximal first-order scheme with stochastic proximal updates. We provide the iteration complexity (in expectation) under the strong convexity assumption on the objective function.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset