atlas

Research map / Optimization / Nonconvex and smooth optimization

On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms

NeurIPS 2023 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 1 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use unified shuffling rather than i.i.d. samplingSGD in the general non-convex setting · Non-convexgradient complexity to a stationary point: \Ocal\left(\sigma^2/\hat{\varepsilon}^2\right) -> \Ocal\left(n\sigma/\hat{\varepsilon}^{3/2}\right)Helped
Use the proposed average-PL and generalized star-smooth-convex framework with small solution varianceUnified shuffling SGD · Non-convex over-parameterized finite-sum problemsgradient complexity to a global solution: \Ocal\left( \frac{n}{\hat{\varepsilon}^{3/2}} \right)Helped
Use arbitrary unified shuffling schemes rather than restricting the analysis to one permutation strategyShuffling SGD · Non-convex over-parameterized finite-sum problemsconvergence guaranteeHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy