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.
Uniform empirical-risk sampling gives an unbiased bounded-variance gradient
Example
Assume AC for the conditional-expectation stationarity bound below. Take instance space , action and label spaces , the population law , the nonempty predictor class with , and squared loss . Fix an ordered sample of integer length with , and let and . Fix a deterministic initial parameter , a constant stepsize , an integer batch size , and an integer horizon . On the finite uniform probability space , where and each point has -mass , write for the coordinate indices, independently uniform with replacement, for and . Set for , set , and set for . At each iteration , average the component gradients to form and set . For the fixed-sample empirical risk , this direction has conditional mean and conditional variance . The objective has -Lipschitz gradient and global infimum , so the expected-average theorem yields The sampling law here is over the fixed empirical sample; no population-risk gradient identity is asserted.
Example references
Supervised prediction-problem definition: fixes the measurable prediction and loss setting.
Population and empirical-risk definition: defines the fixed-sample empirical objective.
Minibatch SGD procedure: specifies the averaged direction and update.
Expected-average stationarity theorem: supplies the conditional-moment guarantee applied here.
Facts & Assumptions
Given: The supervised setup, fixed sample, finite product index law, batch procedure, and AC assumption in the Example.
The Axiom of Choice: AC supplies conditional-expectation classes for the final theorem application.
Supervised prediction problems: predictors are measurable maps and the loss is measurable on the action-label product.
Population and empirical risk: the empirical risk is the finite average of the sample losses.
The derivative of at a point that is a limit point of , and differentiability on a set: the derivative at is the limit of the difference quotient.
Minibatch stochastic gradient descent: the update uses the average of the batch vectors at the current iterate.
Probability measures and probability spaces and Measures on sigma-algebras: the finite uniform space is a probability space with countably additive probability.
Filtration and filtered probability space and Adapted and integrable stochastic process: the filtration records prior index batches and the current iterate is measurable with respect to that history.
Random elements and real random variables: each finite index and scalar component gradient is a measurable random variable.
Conditional expectation as an ae class: conditional expectations are almost-sure classes.
Conditional variance and Conditional variance is well-defined and has the second-moment formula: conditional variance is the conditional second moment of the centered scalar direction.
Expected-average stationarity under aligned stochastic directions: for an unbiased oracle with , constant step , variance bound , and lower bound , the average gradient-square bound is .
Expectation of a nonnegative or integrable random variable: finite-space expectations are finite weighted sums.
Verification
Each is measurable on the singleton instance space, and the squared loss is continuous, hence measurable; with the stated nonempty predictor class and probability law, these data satisfy the supervised-problem interface [F1]. By the empirical-risk definition [F2], . For , , whose limit as is by [F3]. Expanding around also gives , so , its gradient is -Lipschitz, and its global infimum is .
Conditional on any past index batches, each new batch tuple is uniform on . For each component, . Its centered value is , with conditional second moment ; for , the cross moment is . Therefore the average direction has conditional mean and conditional variance .
The mean and variance in step 1.2 satisfy the unbiased branch of [F10] with , , , , and . Since , substitute these values into [F10] to obtain the displayed expected-average bound. The data sample is fixed throughout; no expectation over a population law is used.
Depends on
- Minibatch stochastic gradient descent
- Expected-average stationarity under aligned stochastic directions
- Population and empirical risk
- Supervised prediction problems
- The Axiom of Choice
- Probability measures and probability spaces
- Measures on sigma-algebras
- Random elements and real random variables
- Filtration and filtered probability space
- 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 derivative $f'(c) = \lim_{x \to c} \frac{f(x) - f(c)}{x - c}$ of $f : A \to \mathbb{R}$ at a point $c \in A$ that is a limit point of $A$, and differentiability on a set
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
55 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.