How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Expected-average stationarity under aligned stochastic directions
Statement
Assume AC. Let , , and let be continuously differentiable with -Lipschitz gradient. On a discrete filtered probability space , start at a deterministic and run stochastic gradient descent with square-integrable directions , adapted iterates , and updates . For each , put and , with conditional expectations interpreted coordinatewise almost surely. Let the conditional variance of a vector be the sum of its coordinate conditional variances. Suppose there are constants , , , and such that, almost surely for every , Set .
If the stepsize is constant, with , then for every integer ,
If instead the deterministic stepsizes satisfy , , and , then, with , Conditional unbiasedness is the special case ; a uniform conditional-variance bound then gives and . No convexity or minimizer attainment is assumed.
Facts & Assumptions
Given: AC; the objective, filtered process, SGD updates, conditional direction moments, pathwise lower bound, and either stepsize regime in the Statement.
The Axiom of Choice: AC supplies the conditional-expectation classes used in this theorem.
The local alignment hypothesis is almost surely, with .
The local conditional-mean norm hypothesis is almost surely, with .
The local conditional-variance hypothesis is almost surely, with .
The objective lower bound is almost surely at each iterate.
Stochastic gradient descent: the algorithm uses and imposes no moment or unbiasedness conclusion by itself.
Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates: oracle vectors are adapted; conditional means and vector conditional variances are coordinatewise; the second-moment identity is .
Adapted and integrable stochastic process: an adapted vector process is measurable at its stated time, and integrability is timewise.
Random elements and real random variables: a vector-valued random element is a measurable map into .
Conditional expectation as an ae class: under AC, conditional expectations are almost-sure classes and their equalities are almost-sure equalities.
Conditional variance and Conditional variance is well-defined and has the second-moment formula: conditional variance is the sum of coordinate variances and yields the vector second-moment identity in [F2].
Martingale difference sequence: an integrable adapted sequence with conditional mean zero at the preceding filtration time is a martingale-difference sequence.
Taking out what is known: an integrable product with a finite measurable factor may be taken outside conditional expectation when both products are integrable.
Basic algebra and order properties of conditional expectation: conditional expectation is linear, preserves order, and preserves ordinary expectation.
Tower property of conditional expectation: nested conditional expectations satisfy the tower identity.
The Euclidean inner product on : the inner product and norm are the coordinatewise Euclidean ones.
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: and the Euclidean norm satisfies the triangle inequality.
Expectation of a nonnegative or integrable random variable: expectation is the Lebesgue integral, finite for integrable real random variables.
Finite-horizon SGD trajectories have integrable objectives: finite-horizon SGD iterates, their gradients, and objective values have the integrability needed for conditional expectations and telescoping.
Proof
Fix and write , , and . The filtration and adapted-process conventions [F3, F4], together with the random-element convention [F5], make the time-indexed measurability explicit. By [F16], the objective values, gradients, and oracle vectors used below are integrable. The vector is -measurable and has conditional mean zero given , so each coordinate, after shifting the filtration to , is a martingale difference by [F8]. The conditional variance identity [F2, F7] and [A3]–[A4] give .
Apply [F9] with and , condition on , and use [F10] to take the -measurable gradient factor outside. Each coordinate product is integrable because , with finite expectations by [F16] and the stated oracle moments. Conditional linearity and order [F11] give . All remaining terms are integrable by [F15]–[F16] and the second-moment bound in step 1.1.
For constant , . Take ordinary expectations in step 2.1, using [F11]–[F12], and sum from to . The objective terms telescope and [A5] gives . Divide by to obtain the stated constant-step average bound.
In the diminishing-step regime, implies : otherwise some would satisfy at infinitely many indices, forcing the square sum to diverge. Since , choose so that for every . Apply step 2.1 on this tail, take expectations, and telescope through ; then . The right side is bounded independently of by [F15], [F16], and square summability. The omitted finite prefix has finite weighted sum by [F16]. Thus stays bounded while . Their ratio tends to zero, which is the claimed expectation of the weighted average because each is deterministic.
Depends on
- Stochastic gradient descent
- Finite-horizon SGD trajectories have integrable objectives
- The Axiom of Choice
- Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates
- Filtration and filtered probability space
- Adapted and integrable stochastic process
- Random elements and real random variables
- Conditional expectation as an ae class
- Conditional variance
- Conditional variance is well-defined and has the second-moment formula
- Expectation of a nonnegative or integrable random variable
- Taking out what is known
- Basic algebra and order properties of conditional expectation
- Tower property of conditional expectation
- Martingale difference sequence
- Descent inequality for a Lipschitz gradient
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
Dependency tree · two levels
65 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Léon Bottou, Frank E. Curtis, and Jorge Nocedal, Optimization Methods for Large-Scale Machine Learning, Assumptions 4.1/4.3 and Theorems 4.8/4.10 (standard reference, not scraped)
- MIT 6.7220/15.084 Nonlinear Optimization, Lecture 15: Stochastic Gradient Descent (standard reference, not scraped)