This paper presents a convergence analysis for the Stochastic Recursive Momentum (STORM) optimization algorithm. The authors explore STORM's performance under various geometric conditions, particularly when the standard average smoothness assumption is not met. They derive new convergence rates for nonconvex, convex, and strongly convex objectives, demonstrating STORM's effectiveness with optimal or near-optimal rates across these scenarios. AI
RANK_REASON The item is an academic paper detailing theoretical convergence analysis of an optimization algorithm. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →