mlsanityData to 7 Oct 2026

Stopping Criteria for, and Strong Convergence of, Stochastic Gradient Descent on Bottou-Curtis-Nocedal Functions

arXiv 2004.00475 ↗First posted 1 Apr 2020math.OC cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Stopping criteria for Stochastic Gradient Descent (SGD) methods play important roles from enabling adaptive step size schemes to providing rigor for downstream analyses such as asymptotic inference. Unfortunately, current stopping criteria for SGD methods are often heuristics that rely on asymptotic normality results or convergence to stationary distributions, which may fail to exist for nonconvex functions and, thereby, limit the applicability of such stopping criteria. To address this issue, in this work, we rigorously develop two stopping criteria for SGD that can be applied to a broad class of nonconvex functions, which we term Bottou-Curtis-Nocedal functions. Moreover, as a prerequisite for developing these stopping criteria, we prove that the gradient function evaluated at SGD's iterates converges strongly to zero for Bottou-Curtis-Nocedal functions, which addresses an open question in the SGD literature. As a result of our work, our rigorously developed stopping criteria can be used to develop new adaptive step size schemes or bolster other downstream analyses for nonconvex functions.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 8; 2022: 0; 2023: 3; 2024: 1; 2025: 1.

13 papers.

Sort:

  1. 2023Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGDcited by 41
  2. 2021Stochastic gradient descent with noise of machine learning type. Part I: Discrete time analysiscited by 38
  3. 2021Global Convergence and Stability of Stochastic Gradient Descentcited by 17
  4. 2021On the existence of global minima and convergence analyses for gradient descent methods in the training of deep neural networkscited by 12
  5. 2021A proof of convergence for the gradient descent optimization method with random initializations in the training of neural networks with ReLU activation for piecewise linear target functionscited by 10
  6. 2021A proof of convergence for stochastic gradient descent in the training of artificial neural networks with ReLU activation for constant target functionscited by 9
  7. 2021Existence, uniqueness, and convergence rates for gradient flows in the training of artificial neural networks with ReLU activationcited by 9
  8. 2021Convergence proof for stochastic gradient descent in the training of deep neural networks with ReLU activation for constant target functionscited by 9
  9. 2023High Probability Guarantees for Random Reshufflingcited by 5
  10. 2023Distributed Stochastic Optimization under a General Variance Conditioncited by 4
  11. 2021A Retrospective Approximation Approach for Smooth Stochastic Optimizationcited by 1
  12. 2024Dynamic Decoupling of Placid Terminal Attractor-based Gradient Descent Algorithmcited by 0
1 more
  1. 2025GradES: Significantly Faster Training in Transformers with Gradient-Based Early Stoppingcited by 0