arXiv (All)
open access
Low-rank matrix recovery landscapes beyond RIP with application to rank-one measurements
We study the problem of low-rank matrix recovery from linear measurements via the global nonconvex landscape of a low-rank factored formulation of the matrix LASSO (nuclear-norm--regularized least-squares). If the landscape is benign, that is, has no bad local optima, then practical and scalable alg
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
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
- Nonnegative Matrix Factorization in the Component-Wise L1 Norm for Sparse Data#1035445
- Sparse Reduced-Rank Regression for Simultaneous Rank and Variable Selection via Manifold Optimization#1051927
- Transfer Learning for Matrix Completion#1037729
Record · ID 973750
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