Research map / Optimization / Nonconvex and smooth optimization
Generalization Performance of Multi-pass Stochastic Gradient Descent with Convex Loss Functions
Yunwen Lei, Ting Hu, 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
- Benign Underfitting of Stochastic Gradient Descent (NeurIPS 2022 · similarity 0.91)
- Learning Rates for Stochastic Gradient Descent With Nonconvex Objectives (TPAMI 2021 · similarity 0.90)
- Asymptotic theory of SGD with a general learning-rate (NeurIPS 2025 · similarity 0.90)
- Rapid Overfitting of Multi-Pass SGD in Stochastic Convex Optimization (ICML 2025 · similarity 0.89)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · similarity 0.89)
- Stochastic Optimization Schemes for Performative Prediction with Nonconvex Loss (NeurIPS 2024 · 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.
