Research map / Learning theory and algorithms / Matrix and tensor methods
On the Benefits of Weight Normalization for Overparameterized Matrix Sensing
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
- How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization (ICLR 2024 · similarity 0.89)
- The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing (ICML 2023 · similarity 0.88)
- Globally Q-linear Gauss-Newton Method for Overparameterized Non-convex Matrix Sensing (NeurIPS 2024 · similarity 0.88)
- Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points (ICML 2023 · similarity 0.87)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · similarity 0.85)
- The Nuclear Route: Sharp Asymptotics of ERM in Overparameterized Quadratic Networks (NeurIPS 2025 · similarity 0.84)
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.