arXiv (OAI Expanded)
open access
Near-Optimal Nonconvex Matrix Completion
We study nonconvex methods for matrix completion, the problem of recovering a low-rank matrix from a subset of its entries. Convex methods achieve sample complexity linear in the matrix dimension and the rank, up to logarithmic factors, whereas global guarantees for commonly used nonconvex methods r
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Near-Optimal Nonconvex Matrix Completion#919410
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
- Beyond singular value gaps in randomized subspace approximation#1061683
- N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion#1084022
- An Efficient Newton Algorithm for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence#370329
Record · ID 1123449
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive