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.
Stochastic gradient descent
Definition
Given , a continuously differentiable objective , a discrete filtered probability space , an initial iterate measurable with respect to , an integer horizon , deterministic finite stepsizes , and a stochastic-gradient oracle whose output at is a random vector measurable with respect to , the procedure returns the trajectory . For each iteration , query the oracle at and set No conditional mean, variance, or independence-across-iterations property is part of this procedure's definition.
Definition references
Stochastic-gradient oracle and unconstrained-update definition: fixes the coordinatewise oracle, conditional-moment, and update conventions.
Filtered probability-space definition: fixes the increasing sigma-algebra sequence used to describe information at each iteration.
Adapted-process definition: fixes time-indexed measurability and integrability conventions.
Random-element definition: a vector-valued oracle output is a measurable map into its stated measurable space.
Population and empirical-risk definition: distinguishes the fixed finite-sample objective from population risk.
Supervised prediction-problem definition: fixes the sample, predictor, and loss context for the learning interpretation.
Remarks
The oracle interface does not specify which risk is being optimized. For empirical risk, the objective is the fixed sample average and sampling is over its finite terms. For population risk, sampling is from the population law; identifying the expected sampled gradient with the population-risk gradient requires a separately justified differentiation-under-expectation step. This algorithm asserts neither mean identity.
Remarks references
Population and empirical-risk definition: gives the distinct finite-sample and population objectives.
Supervised prediction-problem definition: specifies the joint law and loss whose population risk is integrated.
Depends on
Used by
Dependency tree · two levels
21 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, Algorithm 4.1 (standard reference, not scraped)
- MIT 6.7220/15.084 Nonlinear Optimization, Lecture 15: Stochastic Gradient Descent (standard reference, not scraped)