paper-with-me

홈 › Papers

The Landscape of Matrix Factorization Revisited

2020-02-27 · Hossein Valavi, Sulin Liu, Peter J. Ramadge

We revisit the landscape of the simple matrix factorization problem. For low-rank matrix factorization, prior work has shown that there exist infinitely many critical points all of which are either global minima or strict saddles. At a strict saddle the minimum eigenvalue of the Hessian is negative. Of interest is whether this minimum eigenvalue is uniformly bounded below zero over all strict saddles. To answer this we consider orbits of critical points under the general linear group. For each orbit we identify a representative point, called a canonical point. If a canonical point is a strict saddle, so is every point on its orbit. We derive an expression for the minimum eigenvalue of the Hessian at each canonical strict saddle and use this to show that the minimum eigenvalue of the Hessian over the set of strict saddles is not uniformly bounded below zero. We also show that a known invariance property of gradient flow ensures the solution of gradient flow only encounters critical points on an invariant manifold $\mathcal{M}_C$ determined by the initial condition. We show that, in contrast to the general situation, the minimum eigenvalue of strict saddles in $\mathcal{M}_{0}$ is uniformly bounded below zero. We obtain an expression for this bound in terms of the singular values of the matrix being factorized. This bound depends on the size of the nonzero singular values and on the separation between distinct nonzero singular values of the matrix.

📄 PDF Abstract BibTeX arXiv:2002.12795

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization

2021-08-03 · Yuetian Luo, Xudong Li, Anru R. Zhang

In this paper, we consider the geometric landscape connection of the widely studied manifold and factorization formulations in low-rank positive semidefinite (PSD) and general matrix optimization. We establish a sandwich…

RelationRetrieval

On the Loss Landscape Geometry of Regularized Deep Matrix Factorization: Uniqueness and Sharpness

2026-03-28 · Anil Kamber, Rahul Parhi arxiv

Weight decay is ubiquitous in training deep neural network architectures. Its empirical success is often attributed to capacity control; nonetheless, our theoretical understanding of its effect on the loss landscape and …

Distributed Low-rank Matrix Factorization With Exact Consensus

2019-12-01 · NeurIPS 2019 12 · Zhihui Zhu, Qiuwei Li, Xinshuo Yang, Gongguo Tang 외

Low-rank matrix factorization is a problem of broad importance, owing to the ubiquity of low-rank models in machine learning contexts. In spite of its non- convexity, this problem has a well-behaved geometric landscape, …

Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods

2021-10-19 · Baturalp Yalcin, Haixiang Zhang, Javad Lavaei, Somayeh Sojoudi

It is well-known that the Burer-Monteiro (B-M) factorization approach can efficiently solve low-rank matrix optimization problems under the RIP condition. It is natural to ask whether B-M factorization-based methods can …

Matrix Completion

Generating gradients in the energy landscape using rectified linear type cost functions for efficiently solving 0/1 matrix factorization in Simulated Annealing

2023-12-27 · Makiko Konoshima, Hirotaka Tamura, Yoshiyuki Kabashima

The 0/1 matrix factorization defines matrix products using logical AND and OR as product-sum operators, revealing the factors influencing various decision processes. Instances and their characteristics are arranged in ro…