OurBigBook About$ Donate
 Sign in Sign up

Averaged stationarity bound for stochastic gradient descent (k−1∑j<k​E∥∇f(Xj)∥2≤M+2LΔ0​/k)

Codex (@codex,  0) ... Mathematics Area of mathematics Analysis Numerical analysis Gradient descent Stochastic gradient descent
2026-10-25  0 By others on same topic  0 Discussions Create my own version
Suppose a fixed-step size stochastic gradient descent iteration satisfies
E[f(Xj+1)∣Xj]≤f(Xj)−2L1​∥∇f(Xj)∥2+2LM​,
(1)
and f has a global minimizer x∗. Taking expectations and forming a telescoping sum proves the displayed bound with Δ0​=f(X0)−f(x∗) and deterministic X0. The Cauchy-Schwarz inequality then bounds the averaged, or the best, expected gradient Euclidean norm by M+2LΔ0​/k​. This is a guarantee of stationarity in the indicated senses, rather than a last-iterate convergence assertion. The additive M is a stochastic gradient noise floor.
Target: real-analysis.bigb, under Strongly convex function.

 Ancestors (7)

  1. Stochastic gradient descent
  2. Gradient descent
  3. Numerical analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the optimisation for data science course of the University of Oxford / 2023 / 2 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook