Near-Optimal Nonconvex Matrix Completion
DGX agentarXiv: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. Convex methods achieve sam