Convergence, Sticking and Escape: Stochastic Dynamics Near Critical Points in SGD

Dmitry Dudukalov, Artem Logachov, Vladimir Lotov, Timofei Prasolov, Evgeny Prokopenko +1 more
5/24/2025
cs.LGmath.PRstat.ML

No confident code implementation found for this paper.

Abstract

We study the convergence properties and escape dynamics of Stochastic Gradient Descent (SGD) in one-dimensional landscapes, separately considering infinite- and finite-variance noise. Our main focus is to identify the time scales on which SGD reliably moves from an initial point to the local minimum in the same ''basin''. Under suitable conditions on the noise distribution, we prove that SGD converges to the basin's minimum unless the initial point lies too close to a local maximum. In that near-maximum scenario, we show that SGD can linger for a long time in its neighborhood. For initial points near a ''sharp'' maximum, we show that SGD does not remain stuck there, and we provide results to estimate the probability that it will reach each of the two neighboring minima. Overall, our findings present a nuanced view of SGD's transitions between local maxima and minima, influenced by both noise characteristics and the underlying function geometry.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dudukalov2025convergence,
  title  = {Convergence, Sticking and Escape: Stochastic Dynamics Near Critical Points in SGD},
  author = {Dmitry Dudukalov and Artem Logachov and Vladimir Lotov and Timofei Prasolov and Evgeny Prokopenko and Anton Tarasenko},
  year   = {2025},
  eprint = {2505.18535},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.18535v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.18535.svg)](https://codeofpaper.com/paper/2505.18535)

Discussion