Baturalp Yalçın — accepted AI-conference papers

2023

Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing

Baturalp Yalçın, Ziye Ma, Javad Lavaei, Somayeh Sojoudi

AAAI 2023technical

Many fundamental low-rank optimization problems, such as matrix completion, phase retrieval, and robust PCA, can be formulated as the matrix sensing problem. Two main approaches for solving matrix sensing are based on semidefinite programming (SDP) and Burer-Monteiro (B-M) factorization. The former…

Cited by 12 Source ↗PDF ↗Scholar ↗

2022

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

Baturalp Yalçın, Haixiang Zhang, Javad Lavaei, Somayeh Sojoudi

AISTATS 2022poster

Burer-Monteiro (B-M) factorization approach can efficiently solve low-rank matrix optimization problems under the Restricted Isometry Property (RIP) condition. It is natural to ask whether B-M factorization-based methods can succeed on any low-rank matrix optimization problems with low information-t…

Cited by 14 Source ↗PDF ↗Scholar ↗