Research map / Optimization / Implicit bias and generalization
Aiming towards the minimizers: fast convergence of SGD for overparametrized problems
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
- The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learning (ICML 2018 · similarity 0.91)
- Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates (NeurIPS 2019 · similarity 0.91)
- Fast convergence of stochastic subgradient method under interpolation (ICLR 2021 · similarity 0.90)
- Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization (ICLR 2019 · similarity 0.90)
- Controlling the Flow: Stability and Convergence for Stochastic Gradient Descent with Decaying Regularization (NeurIPS 2025 · similarity 0.90)
- Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime (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.