R-SPIDER: A Fast Riemannian Stochastic Optimization Algorithm with Curvature Independent Rate
Not on the map. Why?
Abstract (arXiv)
We study smooth stochastic optimization problems on Riemannian manifolds. Via adapting the recently proposed SPIDER algorithm citepfang2018spider (a variance reduced stochastic method) to Riemannian manifold, we can achieve faster rate than known algorithms in both the finite sum and stochastic settings. Unlike previous works, by not resorting to bounding iterate distances, our analysis yields curvature independent convergence rates for both the nonconvex and strongly convex cases.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Nov 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 1.
4 papers.
- 2023Low-complexity subspace-descent over symmetric positive definite manifoldcited by 2
- 2024Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reductioncited by 2
- 2024Continuous-time Riemannian SGD and SVRG Flows on Wasserstein Probabilistic Spacecited by 0
- 2026Fr'echet Regression on the Bures-Wasserstein Manifoldcited by 0
- 2026Fr'echet Regression on the Bures-Wasserstein Manifold4 Apr 2026
- 2024Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction11 Mar 2024
- 2024Continuous-time Riemannian SGD and SVRG Flows on Wasserstein Probabilistic Space24 Jan 2024
- 2023Low-complexity subspace-descent over symmetric positive definite manifold3 May 2023