On the Complexity of Finding Stationary Points in Stochastic $(L_0,L_1)$-Smooth Nonconvex Optimization

Yanpeng Liang, Luo Luo

We study the stochastic first-order oracle (SFO) complexity of finding $\epsilon$-stationary points of $(L_0,L_1)$-smooth nonconvex functions. Under bounded-variance noise, existing analy…