Research map / Optimization / Implicit bias and generalization
Learning Rates for Stochastic Gradient Descent With Nonconvex Objectives
Yunwen Lei, Ke Tang
Read the paperCheck your idea against 137,217 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
- High Probability Guarantees for Nonconvex Stochastic Gradient Descent with Heavy Tails (ICML 2022 · similarity 0.93)
- Asymptotic theory of SGD with a general learning-rate (NeurIPS 2025 · similarity 0.92)
- Noise and Fluctuation of Finite Learning Rate Stochastic Gradient Descent (ICML 2021 · similarity 0.92)
- Toward Better Generalization Bounds of Stochastic Optimization for Nonconvex Learning (TPAMI 2025 · similarity 0.92)
- Learning Rate Decay Can Exponentially Accelerate SGD for Global Optimization of Nonconvex Functions (NeurIPS 2026 · similarity 0.91)
- Statistical Guarantees for High-Dimensional Stochastic Gradient Descent (NeurIPS 2025 · similarity 0.90)
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.
