Research map / Optimization / Implicit bias and generalization
SGD Can Converge to Local Maxima
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
- An Alternative View: When Does SGD Escape Local Minima? (ICML 2018 · similarity 0.91)
- SGD Converges to Global Minimum in Deep Learning via Star-convex Path (ICLR 2019 · similarity 0.91)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · similarity 0.91)
- Stochastic gradient descent performs variational inference, converges to limit cycles for deep networks (ICLR 2018 · similarity 0.91)
- Local SGD Converges Fast and Communicates Little (ICLR 2019 · similarity 0.90)
- A Unified Stability Analysis of SAM vs SGD: Role of Data Coherence and Emergence of Simplicity Bias (NeurIPS 2025 · similarity 0.89)
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.
