Riemannian Stochastic Recursive Momentum Method for non-Convex Optimization.
IJCAI(2021)
摘要
We propose a stochastic recursive momentum method for Riemannian non-convex optimization that achieves a near-optimal complexity of $\tilde{\mathcal{O}}(\epsilon^{-3})$ to find $\epsilon$-approximate solution with one sample. That is, our method requires $\mathcal{O}(1)$ gradient evaluations per iteration and does not require restarting with a large batch gradient, which is commonly used to obtain the faster rate. Extensive experiment results demonstrate the superiority of our proposed algorithm.
更多查看译文
关键词
optimization,stochastic,non-convex
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络