Research map / Learning theory and algorithms / Matrix and tensor methods

Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization

NeurIPS 2021 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization

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

• The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing (ICML 2023 · similarity 0.93)
• Preconditioning Matters: Fast Global Convergence of Non-convex Matrix Factorization via Scaled Gradient Descent (NeurIPS 2023 · similarity 0.92)
• How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization (ICLR 2024 · similarity 0.90)
• Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.90)
• Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions (ICML 2024 · similarity 0.88)
• On the Crucial Role of Initialization for Matrix Factorization (ICLR 2025 · similarity 0.88)