Research map / Optimization / Implicit bias and generalization
Low-rank Solutions of Linear Matrix Equations via Procrustes Flow
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Add spectral (projected gradient) initialization phase before gradient descent | Procrustes Flow for low-rank matrix recovery · theoretical analysis (RIP, Gaussian ensemble) | sample complexity / convergence guarantee | No clear effect |
| Use Omega(nr) Gaussian measurements instead of Omega(nr^3 kappa^2 log n) (Zheng & Lafferty) | gradient descent on Procrustes Flow objective · Gaussian ensemble theory | required number of measurements | Helped |
Closest papers by meaning
- Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow (ICML 2018 · similarity 0.87)
- Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements (AAAI 2022 · similarity 0.87)
- Global Optimality of Local Search for Low Rank Matrix Recovery (NeurIPS 2016 · similarity 0.87)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · similarity 0.87)
- Semi-Random Matrix Completion via Flow-Based Adaptive Reweighting (NeurIPS 2024 · similarity 0.85)
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.