Research map / Optimization / Nonconvex and smooth optimization
A General Analysis of Example-Selection for Stochastic Gradient Descent
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
- Adaptive Sampling for SGD by Exploiting Side Information (ICML 2016 · similarity 0.90)
- Asymptotic theory of SGD with a general learning-rate (NeurIPS 2025 · similarity 0.89)
- Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates (NeurIPS 2019 · similarity 0.88)
- Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems (ICML 2025 · similarity 0.88)
- A Unified Analysis of Stochastic Gradient Descent with Arbitrary Data Permutations and Beyond (NeurIPS 2025 · similarity 0.88)
- Tighter Convergence Bounds for Shuffled SGD via Primal-Dual Perspective (NeurIPS 2024 · similarity 0.87)
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.