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.
Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates
Definition
Fix a finite dimension and a discrete filtered probability space as in Filtration and filtered probability space. A sequence is an iterate process when each coordinate is -measurable; a sequence is an oracle process when each coordinate is -measurable. These are coordinatewise instances of Random elements and real random variables and Adapted and integrable stochastic process. Assume the coordinates used in a conditional moment are square-integrable.
For deterministic stepsizes , the unconstrained Robbins–Monro/SGD update is For a differentiable objective , the oracle is conditionally unbiased when coordinatewise almost surely; it has conditional bias when . The conditional variance of a vector is the sum of the scalar conditional variances of its coordinates, using Conditional variance. By Conditional variance is well-defined and has the second-moment formula, it satisfies almost surely. All conditional expectations are coordinatewise instances of Conditional expectation as an ae class, whose existence assumes the The Axiom of Choice. No independence across iterations is part of this definition.
The conditional second-moment bound and the conditional variance bound are distinct hypotheses; the latter combines with conditional unbiasedness through the displayed identity.
Depends on
- The Axiom of Choice
- Filtration and filtered probability space
- Random elements and real random variables
- Adapted and integrable stochastic process
- 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
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
Used by
- Finite-sum SAGA Algorithm
- Finite-sum SVRG Algorithm
- Projected stochastic-gradient update Definition
- A biased simulator gradient has limiting squared gradient b² Example
- A bounded-noise Robbins–Monro scalar root Example
- One streaming least-squares SGD update Example
- SAGA conditional estimator, variance, and table recurrence Lemma
- SVRG conditional unbiasedness and variance bound Lemma
- Biased SGD has an explicit weighted stationarity floor Theorem
- Conditional variance of independent and without-replacement minibatches Theorem
- Finite-time projected SGD bound for a convex objective Theorem
- Last-iterate SGD rate for smooth strongly convex objectives Theorem
- Nonconvex SGD stationarity bound for a uniform randomized iterate Theorem
- Projected SGD converges almost surely on a strongly convex objective Theorem
- Robbins–Monro converges almost surely for a strongly monotone root Theorem
- Summably biased SPSA has convergent objective values and zero gradient liminf Theorem
- Weighted simulator moments give an inverse-step SPSA variance bound Theorem
Dependency tree · two levels
39 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.1 (standard reference, not scraped)
- Sébastien Bubeck, Convex Optimization: Algorithms and Complexity, §§6.1–6.2 (standard reference, not scraped)