mlsanityData to 14 Oct 2026

Rank-one matrix estimation: analytic time evolution of gradient descent dynamics

arXiv 2105.12257 ↗First posted 25 May 2021stat.ML cs.LG math.PRcited by 5

Not on the map. Why?

Abstract (arXiv)

We consider a rank-one symmetric matrix corrupted by additive noise. The rank-one matrix is formed by an n-component unknown vector on the sphere of radius √n, and we consider the problem of estimating this vector from the corrupted matrix in the high dimensional limit of n large, by gradient descent for a quadratic cost function on the sphere. Explicit formulas for the whole time evolution of the overlap between the estimator and unknown vector, as well as the cost, are rigorously derived. In the long time limit we recover the well known spectral phase transition, as a function of the signal-to-noise ratio. The explicit formulas also allow to point out interesting transient features of the time evolution. Our analysis technique is based on recent progress in random matrix theory and uses local versions of the semi-circle law.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 11 of its 28 references that are in the map. First posted on arXiv 25 May 2021.

Builds on

11 of 28 references.

References · 11

  1. 2018Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overviewcited by 160
  2. 2017No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysiscited by 129
  3. 2016Global Optimality of Local Search for Low Rank Matrix Recoverycited by 82
  4. 2016Non-square matrix sensing without spurious local minima via the Burer-Monteiro approachcited by 38
  5. 2019Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Modelscited by 28
  6. 2016Mutual information for symmetric rank-one matrix estimation: A proof of the replica formulacited by 26
  7. 2014Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problemscited by 25
  8. 2019Who is Afraid of Big Bad Minima? Analysis of Gradient-Flow in a Spiked Matrix-Tensor Modelcited by 25
  9. 2018Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inferencecited by 24
  10. 2016On the low-rank approach for semidefinite programs arising in synchronization and community detectioncited by 17
  11. 2018On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimizationcited by 11

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 1.

5 papers.