2020/08/11 by Andi Han, Han, Andi, Junbin Gao +1 · 4 citations
Computer Science · Engineering · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Markov Chains and Monte Carlo Methods #Optimization and Control (math.OC) #Sparse and Compressive Sensing Techniques #Stochastic Gradient Optimization Techniques
paper · pdf · doi:10.48550/arxiv.2008.04555
openalex publication_date 2020/08/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a stochastic recursive momentum method for Riemannian non-convex optimization that achieves a near-optimal complexity of O(ε-3) to find ε-approximate solution with one sample. That is, our method requires 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.