Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 d≥1, L>0, and let f:Rd→R be continuously differentiable with L-Lipschitz gradient. On a discrete filtered probability space (Ω,F,(Ft)t≥0,P), start at a deterministic x1 and run stochastic gradient descent with square-integrable directions Gt, adapted iterates xt, and updates xt+1=xt−αtGt. For each t≥1, put gt=∇f(xt) and mt=E[Gt∣Ft], 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 μG≥μ>0, M≥0, MV≥0, and Finf⁡∈R such that, almost surely for every t, ⟨gt,mt⟩≥μ∥gt∥22,∥mt∥2≤μG∥gt∥2,Var⁡(Gt∣Ft)≤M+MV∥gt∥22,f(xt)≥Finf⁡. Set MG=MV+μG2>0.

If the stepsize is constant, αt=α with 0<α≤μ/(LMG), then for every integer T≥1, E[1T∑t=1T∥∇f(xt)∥22]≤αLMμ+2(f(x1)−Finf⁡)Tμα.

If instead the deterministic stepsizes satisfy αt>0, ∑t=1∞αt=∞, and ∑t=1∞αt2<∞, then, with AT=∑t=1Tαt, E[1AT∑t=1Tαt∥∇f(xt)∥22]⟶0(T→∞). Conditional unbiasedness is the special case μ=μG=1; a uniform conditional-variance bound σ2 then gives M=σ2 and MV=0. 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.

[A1]

The Axiom of Choice: AC supplies the conditional-expectation classes used in this theorem.

[A2]

The local alignment hypothesis is ⟨gt,mt⟩≥μ∥gt∥22 almost surely, with μ>0.

[A3]

The local conditional-mean norm hypothesis is ∥mt∥2≤μG∥gt∥2 almost surely, with μG≥μ.

[A4]

The local conditional-variance hypothesis is Var⁡(Gt∣Ft)≤M+MV∥gt∥22 almost surely, with M,MV≥0.

[A5]

The objective lower bound is f(xt)≥Finf⁡ almost surely at each iterate.

[F1]

Stochastic gradient descent: the algorithm uses xt+1=xt−αtGt and imposes no moment or unbiasedness conclusion by itself.

[F2]

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 E[∥Gt∥22∣Ft]=∥mt∥22+Var⁡(Gt∣Ft).

[F3]

Filtration and filtered probability space: Ft⊆Ft+1⊆F.

[F4]

Adapted and integrable stochastic process: an adapted vector process is measurable at its stated time, and integrability is timewise.

[F5]

Random elements and real random variables: a vector-valued random element is a measurable map into Rd.

[F6]

Conditional expectation as an ae class: under AC, conditional expectations are almost-sure classes and their equalities are almost-sure equalities.

[F7]

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].

[F8]

Martingale difference sequence: an integrable adapted sequence with conditional mean zero at the preceding filtration time is a martingale-difference sequence.

[F9]

Descent inequality for a Lipschitz gradient: f(y)≤f(x)+⟨∇f(x),y−x⟩+(L/2)∥y−x∥22.

[F10]

Taking out what is known: an integrable product with a finite measurable factor may be taken outside conditional expectation when both products are integrable.

[F11]

Basic algebra and order properties of conditional expectation: conditional expectation is linear, preserves order, and preserves ordinary expectation.

[F12]

Tower property of conditional expectation: nested conditional expectations satisfy the tower identity.

[F13]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: the inner product and norm are the coordinatewise Euclidean ones.

[F14]
[F15]

Expectation of a nonnegative or integrable random variable: expectation is the Lebesgue integral, finite for integrable real random variables.

[F16]

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

1.1A1A3A4F2F3F4F5F6F7F8F15F16givenalgebra

Fix t≥1 and write gt=∇f(xt), mt=E[Gt∣Ft], and εt=Gt−mt. 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 εt is Ft+1-measurable and has conditional mean zero given Ft, so each coordinate, after shifting the filtration to Hn=Fn+1, is a martingale difference by [F8]. The conditional variance identity [F2, F7] and [A3]–[A4] give E[∥Gt∥22∣Ft]=∥mt∥22+Var⁡(Gt∣Ft)≤M+(MV+μG2)∥gt∥22=M+MG∥gt∥22.

2.1A1A2A3A4F1F9F10F11F13F14F15F16step 1.1algebra

Apply [F9] with x=xt and y=xt+1=xt−αtGt, condition on Ft, and use [F10] to take the Ft-measurable gradient factor outside. Each coordinate product is integrable because 2∣gt,jGt,j∣≤gt,j2+Gt,j2, with finite expectations by [F16] and the stated oracle moments. Conditional linearity and order [F11] give E[f(xt+1)∣Ft]≤f(xt)−αt⟨gt,mt⟩+Lαt22E[∥Gt∥22∣Ft]≤f(xt)−(μαt−LMGαt22)∥gt∥22+LMαt22. All remaining terms are integrable by [F15]–[F16] and the second-moment bound in step 1.1.

3.1A5F11F12F15F16step 2.1givenalgebra

For constant α≤μ/(LMG), μα−LMGα2/2≥μα/2. Take ordinary expectations in step 2.1, using [F11]–[F12], and sum from t=1 to T. The objective terms telescope and [A5] gives μα2∑t=1TE∥gt∥22≤f(x1)−Finf⁡+Lα2MT2. Divide by Tμα/2 to obtain the stated constant-step average bound.

4.1A1A2A3A4A5F11F12F15F16step 2.1choosealgebra∎

In the diminishing-step regime, ∑tαt2<∞ implies αt→0: otherwise some ϵ>0 would satisfy αt≥ϵ at infinitely many indices, forcing the square sum to diverge. Since μ/(LMG)>0, choose K so that αt≤μ/(LMG) for every t≥K. Apply step 2.1 on this tail, take expectations, and telescope through T≥K; then μ2∑t=KTαtE∥gt∥22≤Ef(xK)−Finf⁡+LM2∑t=KTαt2. The right side is bounded independently of T by [F15], [F16], and square summability. The omitted finite prefix has finite weighted sum by [F16]. Thus ∑t=1TαtE∥gt∥22 stays bounded while AT=∑t=1Tαt→∞. Their ratio tends to zero, which is the claimed expectation of the weighted average because each αt is deterministic.

Depends on

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