Research map / Learning theory and algorithms / Matrix and tensor methods
Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA
Ji Chen, Xiaodong Li
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis (ICML 2017 · similarity 0.92)
- Nonconvex Matrix Completion with Linearly Parameterized Factors (JMLR 2022 · similarity 0.91)
- Nearly Optimal Robust Matrix Completion (ICML 2017 · similarity 0.90)
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.90)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.89)
- Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time (ICLR 2024 · similarity 0.88)
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.
