Research map / Optimization / Nonconvex and smooth optimization
Faster Gradient-Free Methods for Escaping Saddle Points
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
- Escape saddle points by a simple gradient-descent based algorithm (NeurIPS 2021 · similarity 0.95)
- How to Escape Saddle Points Efficiently (ICML 2017 · similarity 0.93)
- Gradient Descent Can Take Exponential Time to Escape Saddle Points (NeurIPS 2017 · similarity 0.92)
- Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity (NeurIPS 2025 · similarity 0.88)
- Escaping saddle points without Lipschitz smoothness: the power of nonlinear preconditioning (NeurIPS 2025 · similarity 0.88)
- Second-Order Min-Max Optimization with Lazy Hessians (ICLR 2025 · similarity 0.86)
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.