Research map / Optimization / Nonconvex and smooth optimization
Geometric Analysis of Nonconvex Optimization Landscapes for Overcomplete Learning
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
- Efficient Dictionary Learning with Gradient Descent (ICML 2019 · similarity 0.86)
- On the Optimization Landscape of Tensor Decompositions (NeurIPS 2017 · similarity 0.85)
- Online Partial Least Square Optimization: Dropping Convexity for Better Efficiency and Scalability (ICML 2017 · similarity 0.85)
- Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity (ICML 2016 · similarity 0.85)
- No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis (ICML 2017 · similarity 0.84)
- Optimization Can Learn Johnson Lindenstrauss Embeddings (NeurIPS 2024 · 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.