Convergence Analysis of STORM Under Different Geometries
Wei Jiang, Yibo Wang, Wenhao Yang, Rui Yan, Lijun Zhang, Zechao Li
Abstract
Stochastic recursive momentum (STORM) achieves fast convergence for nonconvex optimization via the variance reduction effect, but existing analyses rely on the strong average smoothness assumption. In this paper, we study the convergence of STORM for different objectives without average smoothness. We first revisit the results under average smoothness, obtaining the O(T-1/3) bound for nonconvex objectives and the O(σ2/(μT)) bound for last-iterate output under the μ-Polyak--Łojasiewicz~(PL) condition. Without average smoothness, we design an auxiliary sequence and compare the STORM update with it in the analysis. With the help of this sequence, we prove that STORM still attains an O(T-1/4) rate for nonconvex objectives, which is optimal under standard smoothness. For convex and λ-strongly convex objectives, we further prove averaged and last-iterate bounds with optimal rates of O(σR/ T) and O(σ2/(λT)), respectively. All the obtained results use the same STORM recursion with different hyperparameter choices.
Create a lesson
Related papers
Randomized Matvec Lower Bounds for Simplex-Based Matrix Games
Wendao Wu, Cong Fang
Optimal Stochastic Bilevel Optimization with First-Order Oracles
Linxuan Pan, Junchi Yang
Recognizing Signomial Convexity is Hard
Rui Zheng, Iosif Sakos, Antonios Varvitsiotis
Simplifying the computation of weak- second subderivatives of convex functionals via Γ-convergence
Gerd Wachsmuth
Routing in Line Networks with Handling Times
Gabriel Deza, Michal Tzur, Tal Raviv
Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization
Jiayi Song, Zi Xu