mlsanityData to 7 Oct 2026

On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization

arXiv 2110.12121 ↗First posted 23 Oct 2021math.OC cs.IT cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a general procedure for establishing the geometric landscape connections of a Riemannian optimization problem under the embedded and quotient geometries. By applying the general procedure to the fixed-rank positive semidefinite (PSD) and general matrix optimization, we establish an exact Riemannian gradient connection under two geometries at every point on the manifold and sandwich inequalities between the spectra of Riemannian Hessians at Riemannian first-order stationary points (FOSPs). These results immediately imply an equivalence on the sets of Riemannian FOSPs, Riemannian second-order stationary points (SOSPs), and strict saddles of fixed-rank matrix optimization under the embedded and the quotient geometries. To the best of our knowledge, this is the first geometric landscape connection between the embedded and the quotient geometries for fixed-rank matrix optimization and it provides a concrete example of how these two geometries are connected in Riemannian optimization. In addition, the effects of the Riemannian metric and quotient structure on the landscape connection are discussed. We also observe an algorithmic connection between two geometries with some specific Riemannian metrics in fixed-rank matrix optimization: there is an equivalence between gradient flows under two geometries with shared spectra of Riemannian Hessians. A number of novel ideas and technical ingredients including a unified treatment for different Riemannian metrics, novel metrics for the Stiefel manifold, and new horizontal space representations under quotient geometries are developed to obtain our results. The results in this paper deepen our understanding of geometric and algorithmic connections of Riemannian optimization under different Riemannian geometries and provide a few new theoretical insights to unanswered questions in the literature.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 59 references that are in the map. First posted on arXiv 23 Oct 2021.

Builds on

21 of 59 references.

References · 21

  1. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
  2. 2018Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overviewcited by 159
  3. 2015Low-rank Solutions of Linear Matrix Equations via Procrustes Flowcited by 97
  4. 2016A Geometric Analysis of Phase Retrievalcited by 92
  5. 2014Guaranteed Matrix Completion via Non-convex Factorizationcited by 81
  6. 2017Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolutioncited by 63
  7. 2016Global rates of convergence for nonconvex optimization on manifoldscited by 61
  8. 2015Dropping Convexity for Faster Semi-definite Optimizationcited by 40
  9. 2019A Brief Introduction to Manifold Optimizationcited by 35
  10. 2019Escaping from saddle points on Riemannian manifoldscited by 33
  11. 2018Harnessing Structures in Big Data via Guaranteed Low-Rank Matrix Estimationcited by 25
  12. 2019Efficiently escaping saddle points on manifoldscited by 24
9 more
  1. 2017On the Optimization Landscape of Tensor Decompositionscited by 21
  2. 2014Riemannian preconditioningcited by 19
  3. 2017A Well-Tempered Landscape for Non-convex Robust Subspace Recoverycited by 18
  4. 2020Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergencecited by 11
  5. 2020Fast Global Convergence for Low-rank Matrix Recovery via Riemannian Gradient Descent with Random Initializationcited by 8
  6. 2018An equivalence between critical points for rank constraints versus low-rank factorizationscited by 4
  7. 2021Riemannian Perspective on Matrix Factorizationcited by 3
  8. 2021Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimizationcited by 3
  9. 2013Low-rank optimization for distance matrix completioncited by 2

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1.

3 papers.