Preprint Open access
Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity
We consider stochastic nonsmooth nonconvex composite optimization, which includes several important problems such as constrained optimization and the regularized training of neural networks. The objective is the sum of a possibly nonsmooth nonconvex Lipschitz function and a convex regularizer, and the function is acces …