Paper Overview
- Field: Machine Learning
- Authors: Jiaxin Jiang, Lei Shi, Jiyuan Tan
- Published: 2025-03-18
- arXiv: 2503.13851
- A Riemannian Mirror Descent (RMD) framework derived via reparameterization
- A stochastic variant of RMD for large-scale problems
- Non-asymptotic convergence guarantees for both RMD and stochastic RMD
- Application to the Stiefel manifold, recovering CGD and extending it to the stochastic setting
Abstract
Mirror Descent (MD) is a scalable first-order method widely used in large-scale optimization, with applications in image processing, policy optimization, and neural network training. This paper generalizes MD to optimization on Riemannian manifolds. In particular, the authors develop a Riemannian Mirror Descent (RMD) framework via reparameterization and further propose a stochastic variant of RMD. They also establish non-asymptotic convergence guarantees for both RMD and stochastic RMD.
As an application to the Stiefel manifold, the RMD framework reduces to the Curvilinear Gradient Descent (CGD) method proposed in [26]. Moreover, when specializing the stochastic RMD framework to the Stiefel setting, the result is a stochastic extension of CGD, which effectively addresses large-scale manifold optimization problems.
Key Contributions
*Auto-collected on 2026-03-19*