Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Projected SGD converges almost surely on a strongly convex objective

Statement

Assume AC. Let C⊆Rd be nonempty, closed, and convex. Let f:Rd→R be differentiable, and suppose F=f+ιC is μ-strongly convex for μ>0 in the sense of Strong convexity for an extended-real objective, where ιC is zero on C and +∞ off C (Extended-real indicator of a set). Assume a minimizer x∗∈C exists. Start projected SGD as in Projected stochastic-gradient update from square-integrable x0∈C, with E[Gk∣Fk]=∇f(xk),E[∥Gk∥22∣Fk]≤M2 almost surely for every k, where M<∞. For deterministic stepsizes satisfying 0<αk≤1/(2μ), ∑kαk=∞, and ∑kαk2<∞, the iterates converge almost surely to x∗. The projection supplies stability, so no separate coercivity hypothesis is needed for this projected theorem.

Facts & Assumptions

Given: AC, C,f,μ,x∗, the adapted projected update, the conditional oracle bounds, and the stepsize assumptions in the Statement.

[A1]

The Axiom of Choice: AC is assumed for conditional-expectation existence and the Doob convergence interface.

[F1]

Projected stochastic-gradient update: xk+1=PC(xk−αkGk) and PC is the unique nearest-point map.

[F3]

The proximal map of an indicator is Euclidean projection: for nonempty closed convex C, prox⁡tιC is the singleton map PC for every t>0.

[F4]

Strong convexity makes a differentiable gradient strongly monotone: ⟨∇f(x)−∇f(y),x−y⟩≥μ∥x−y∥22 for x,y∈C.

[F5]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): the derivative of t↦f(x+td) is ⟨∇f(x+td),d⟩.

[F6]

Taking out what is known and Basic algebra and order properties of conditional expectation: integrable Fk-measurable factors may be taken outside conditional expectation, which is linear and expectation-preserving.

[F7]

Robbins–Siegmund almost-supermartingale convergence: a nonnegative adapted integrable process with summable deterministic errors and predictable decrement converges almost surely, with finite total decrement.

[F10]

The principle of mathematical induction: a property true at the first index and inherited by each successor holds at every natural index.

[F11]

Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates: vector conditional second moment equals the squared conditional mean plus nonnegative vector conditional variance.

[F12]

Strong convexity for an extended-real objective: strong convexity means F((1−t)x+ty)≤(1−t)F(x)+tF(y)−(μ/2)t(1−t)∥x−y∥22 for 0<t<1 on dom⁡F=C.

[F13]

Extended-real indicator of a set: ιC is 0 on C and +∞ off C, so F=f+ιC has effective domain C and agrees with f there.

Proof

1.1A1F1F2F3F6F8F9F10F11givenalgebrainduction

Since PC is the proximal map of ιC by [F3], [F2] makes it nonexpansive and therefore continuous; [F3] also gives PC(x∗)=x∗ and xk+1∈C. The point xk−αkGk is Fk+1-measurable, so continuity makes xk+1 Fk+1-measurable. Thus the distance process is adapted. Hence Vk+1=∥xk+1−x∗∥22≤∥xk−αkGk−x∗∥22≤(1+μαk)Vk+(αk/μ+αk2)∥Gk∥22, where the last inequality follows by expanding the square, applying [F8], [F9], and using 2uv≤μu2+μ−1v2. By [F6], E∥Gk∥22≤M2, so induction from square-integrable x0 shows each Vk is integrable. By [F11] and the conditional moment bound, ∥∇f(xk)∥22=∥E[Gk∣Fk]∥22≤M2 almost surely. Cauchy–Schwarz therefore makes the cross products in the conditional expansion integrable.

1.2F5givenchoose

For any y∈C and 0<t≤1, convexity of C gives x∗+t(y−x∗)∈C. Minimality of x∗ implies f(x∗+t(y−x∗))≥f(x∗). Divide by t and let t↓0; [F5] makes the quotient tend to ⟨∇f(x∗),y−x∗⟩, which must be nonnegative because a limit of nonnegative reals is nonnegative.

2.1A1F4F6F8F12F13step 1.1step 1.2givenalgebra

By [F13], dom⁡F=C and F=f on C, so the strong-Jensen condition [F12] is exactly the hypothesis of [F4]. Apply [F4] to xk,x∗ and use step 1.2 with y=xk to obtain ⟨∇f(xk),xk−x∗⟩≥μVk. Expanding the projection estimate in step 1.1 and conditioning with [F6] now gives E[Vk+1∣Fk]≤Vk−2μαkVk+M2αk2.

3.1A1F7step 1.1step 2.1givenalgebra∎

Apply [F7] with ak=0, bk=2μαkVk, and ck=M2αk2. Step 1.1 gives integrability, and the stepsize conditions give ∑ck<∞. Thus Vk converges almost surely and ∑kαkVk<∞ almost surely. If its limit were positive, the divergent sum ∑kαk would force ∑kαkVk=∞, a contradiction. Therefore Vk→0 and xk→x∗ almost surely.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

74 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