No article text was recorded for this version.
spurious local minima (non-convex optimization traps)
Version 1 of 126 papers30 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing
- Blog: Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods
- Blog: The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
- Blog: Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points
- Blog: The non-convex Burer-Monteiro approach works on smooth semidefinite programs
- Blog: Matrix Sensing with Kernel Optimal Loss: Robustness and Optimization Landscape
- Blog: Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery
- Blog: Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
- Blog: A new complexity metric for nonconvex rank-one generalized matrix completion
- Blog: Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate
- Blog: Algorithmic Regularization in Tensor Optimization: Towards a Lifted Approach in Matrix Sensing
- Blog: Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems
- Blog: Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points
- Blog: Global Optimality in Low-rank Matrix Optimization
- Blog: Polynomial time guarantees for the Burer-Monteiro method
- Blog: Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
- Blog: Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements
- Blog: Low-Rank Univariate Sum of Squares Has No Spurious Local Minima
- Blog: Preconditioned Gradient Descent for Overparameterized Nonconvex Burer-Monteiro Factorization with Global Optimality Certification
- Blog: On the low-rank approach for semidefinite programs arising in synchronization and community detection
- Blog: Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Blog: On the Absence of Spurious Local Minima in Nonlinear Low-Rank Matrix Recovery Problems
- Blog: Provable non-convex projected gradient descent for a class of constrained matrix optimization problems
- Blog: Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses
- Blog: General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds
- Blog: Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support
History & citation
Current · Permanent link
- This direction split from Global Optimality in Non-convex Low-Rank Matrix Factorization (100% overlap)
- This direction split from low-rank matrix factorization (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_spurious_local_minima_non_convex_optimiz_4747f2fd,
title = {spurious local minima (non-convex optimization traps)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spurious-local-minima-non-convex-optimization-traps/rdr_4747f2fdde1f4011aa50a3a6b3a68495},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_spurious_local_minima_non_convex_optimiz_4747f2fd_v1,
title = {spurious local minima (non-convex optimization traps)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spurious-local-minima-non-convex-optimization-traps/rdr_4747f2fdde1f4011aa50a3a6b3a68495/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}