ResearchTrend.AI
Escape saddle points faster on manifolds via perturbed Riemannian stochastic recursive gradient

Escape saddle points faster on manifolds via perturbed Riemannian stochastic recursive gradient

Andi Han
Junbin Gao
ArXivPDFHTML

Papers citing "Escape saddle points faster on manifolds via perturbed Riemannian stochastic recursive gradient"

2 / 2 papers shown
Title
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
Andi Han
Pierre-Louis Poirion
Akiko Takeda
22
0
0
18 May 2025
Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
Yuetian Luo
Xudong Li
Anru R. Zhang
33
9
0
03 Aug 2021