Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis
Not on the map. Why?
Abstract (arXiv)
Stochastic variance reduction algorithms have recently become popular for minimizing the average of a large, but finite number of loss functions. The present paper proposes a Riemannian stochastic quasi-Newton algorithm with variance reduction (R-SQN-VR). The key challenges of averaging, adding, and subtracting multiple gradients are addressed with notions of retraction and vector transport. We present convergence analyses of R-SQN-VR on both non-convex and retraction-convex functions under retraction and vector transport operators. The proposed algorithm is evaluated on the Karcher mean computation on the symmetric positive-definite manifold and the low-rank matrix completion on the Grassmann manifold. In all cases, the proposed algorithm outperforms the state-of-the-art Riemannian batch and stochastic gradient algorithms.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Mar 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2.
2 papers.
- 2022Riemannian Natural Gradient Methodscited by 5
- 2022Riemannian Stochastic Gradient Method for Nested Composition Optimizationcited by 1
- 2022Riemannian Stochastic Gradient Method for Nested Composition Optimization19 Jul 2022
- 2022Riemannian Natural Gradient Methods15 Jul 2022