Research map / Optimization / Implicit bias and generalization
Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization
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.
Closest papers by meaning
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.93)
- Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent (NeurIPS 2016 · similarity 0.92)
- Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion (NeurIPS 2022 · similarity 0.91)
- No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis (ICML 2017 · similarity 0.90)
- Generalization Analysis of Deep Non-linear Matrix Completion (ICML 2024 · similarity 0.88)
- How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization (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.