arXiv Machine Learning
Sep 16

Near-Optimal Nonconvex Matrix Completion

arXiv:2609. 17048v1 Announce Type: cross Abstract: We study nonconvex methods for matrix completion, the problem of recovering a low-rank matrix from a subset of its entries.

By Jian-Feng Cai, Xiliang Lu, Juntao You