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 be nonempty, closed, and convex. Let be differentiable, and suppose is -strongly convex for in the sense of Strong convexity for an extended-real objective, where is zero on and off (Extended-real indicator of a set). Assume a minimizer exists. Start projected SGD as in Projected stochastic-gradient update from square-integrable , with almost surely for every , where . For deterministic stepsizes satisfying , , and , the iterates converge almost surely to . The projection supplies stability, so no separate coercivity hypothesis is needed for this projected theorem.
Facts & Assumptions
Given: AC, , the adapted projected update, the conditional oracle bounds, and the stepsize assumptions in the Statement.
The Axiom of Choice: AC is assumed for conditional-expectation existence and the Doob convergence interface.
Projected stochastic-gradient update: and is the unique nearest-point map.
Existence, resolvent characterization, and firm nonexpansiveness of the proximal map: the proximal map is nonexpansive.
The proximal map of an indicator is Euclidean projection: for nonempty closed convex , is the singleton map for every .
The chain rule for total derivatives: : the derivative of is .
Taking out what is known and Basic algebra and order properties of conditional expectation: integrable -measurable factors may be taken outside conditional expectation, which is linear and expectation-preserving.
Robbins–Siegmund almost-supermartingale convergence: a nonnegative adapted integrable process with summable deterministic errors and predictable decrement converges almost surely, with finite total decrement.
The principle of mathematical induction: a property true at the first index and inherited by each successor holds at every natural index.
Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates: vector conditional second moment equals the squared conditional mean plus nonnegative vector conditional variance.
Strong convexity for an extended-real objective: strong convexity means for on .
Extended-real indicator of a set: is on and off , so has effective domain and agrees with there.
Proof
Since is the proximal map of by [F3], [F2] makes it nonexpansive and therefore continuous; [F3] also gives and . The point is -measurable, so continuity makes -measurable. Thus the distance process is adapted. Hence where the last inequality follows by expanding the square, applying [F8], [F9], and using . By [F6], , so induction from square-integrable shows each is integrable. By [F11] and the conditional moment bound, almost surely. Cauchy–Schwarz therefore makes the cross products in the conditional expansion integrable.
For any and , convexity of gives . Minimality of implies . Divide by and let ; [F5] makes the quotient tend to , which must be nonnegative because a limit of nonnegative reals is nonnegative.
By [F13], and on , so the strong-Jensen condition [F12] is exactly the hypothesis of [F4]. Apply [F4] to and use step 1.2 with to obtain . Expanding the projection estimate in step 1.1 and conditioning with [F6] now gives
Apply [F7] with , , and . Step 1.1 gives integrability, and the stepsize conditions give . Thus converges almost surely and almost surely. If its limit were positive, the divergent sum would force , a contradiction. Therefore and almost surely.
Depends on
- Projected stochastic-gradient update
- Extended-real indicator of a set
- Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates
- Strong convexity for an extended-real objective
- Robbins–Siegmund almost-supermartingale convergence
- Strong convexity makes a differentiable gradient strongly monotone
- Existence, resolvent characterization, and firm nonexpansiveness of the proximal map
- The proximal map of an indicator is Euclidean projection
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- Taking out what is known
- Basic algebra and order properties of conditional expectation
- The Axiom of Choice
- 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
- The principle of mathematical induction
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
- Léon Bottou, Frank E. Curtis, and Jorge Nocedal, Optimization Methods for Large-Scale Machine Learning, SIAM Review 60(2) (2018), §4.2 (standard reference, not scraped)
- Dimitri P. Bertsekas, Convex Optimization Algorithms, Appendix A, Proposition A.4.5 (standard reference, not scraped)