Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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 ({∗},2{∗}), action and label spaces (R,B(R)), the population law Ppop=δ(∗,0), the nonempty predictor class F={hθ:θ∈R} with hθ(∗)=θ, and squared loss ℓ(a,y)=12(a−y)2. Fix an ordered sample S=((∗,y1),…,(∗,ym)) of integer length m≥1 with yi∈R, and let yˉ=m−1∑iyi and vS=m−1∑i(yi−yˉ)2. Fix a deterministic initial parameter θ1∈R, a constant stepsize 0<α≤1, an integer batch size b≥1, and an integer horizon T≥1. On the finite uniform probability space (Ω,2Ω,Q), where Ω={1,…,m}bT and each point has Q-mass m−bT, write It,j for the coordinate indices, independently uniform with replacement, for 1≤t≤T and 1≤j≤b. Set Ft=σ(Is,j:1≤s<t, 1≤j≤b) for 1≤t≤T+1, set F0=F1={∅,Ω}, and set Ft=FT+1 for t>T+1. At each iteration t=1,…,T, average the component gradients to form Gt=b−1∑j=1b(θt−yIt,j) and set θt+1=θt−αGt. For the fixed-sample empirical risk R^S(hθ), this direction has conditional mean EQ[Gt∣Ft]=θt−yˉ=ddθR^S(hθt) and conditional variance Var⁡Q(Gt∣Ft)=vS/b. The objective has 1-Lipschitz gradient and global infimum vS/2, so the expected-average theorem yields 1T∑t=1TEQ∣ddθR^S(hθt)∣2≤αvSb+(θ1−yˉ)2Tα. 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.

[A1]

The Axiom of Choice: AC supplies conditional-expectation classes for the final theorem application.

[F1]

Supervised prediction problems: predictors are measurable maps and the loss is measurable on the action-label product.

[F2]

Population and empirical risk: the empirical risk is the finite average of the sample losses.

[F4]

Minibatch stochastic gradient descent: the update uses the average of the batch vectors at the current iterate.

[F5]

Probability measures and probability spaces and Measures on sigma-algebras: the finite uniform space is a probability space with countably additive probability.

[F6]

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.

[F7]

Random elements and real random variables: each finite index and scalar component gradient is a measurable random variable.

[F8]

Conditional expectation as an ae class: conditional expectations are almost-sure classes.

[F9]

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.

[F10]

Expected-average stationarity under aligned stochastic directions: for an unbiased oracle with μ=μG=1, constant step α≤1/L, variance bound M, and lower bound Finf⁡, the average gradient-square bound is αLM+2(f(θ1)−Finf⁡)/(Tα).

[F11]

Expectation of a nonnegative or integrable random variable: finite-space expectations are finite weighted sums.

Verification

1.1F1F2F3givenalgebra

Each hθ 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], FS(θ)=R^S(hθ)=12m∑i=1m(θ−yi)2. For h≠0, [FS(θ+h)−FS(θ)]/h=m−1∑i(θ−yi)+h/2=θ−yˉ+h/2, whose limit as h→0 is θ−yˉ by [F3]. Expanding around yˉ also gives FS(θ)=12(θ−yˉ)2+vS/2, so FS′(θ)=θ−yˉ, its gradient is 1-Lipschitz, and its global infimum is vS/2.

1.2F4F5F6F7F8F9F11givenalgebra

Conditional on any past index batches, each new batch tuple is uniform on {1,…,m}b. For each component, E[θt−yIt,j∣Ft]=θt−yˉ. Its centered value is yˉ−yIt,j, with conditional second moment vS; for i≠j, the cross moment is m−2(∑r(yˉ−yr))2=0. Therefore the average direction has conditional mean θt−yˉ and conditional variance b−2(bvS)=vS/b.

2.1A1F10step 1.1step 1.2givenalgebra∎

The mean and variance in step 1.2 satisfy the unbiased branch of [F10] with μ=μG=1, M=vS/b, MV=0, L=1, and Finf⁡=vS/2. Since 0<α≤1=μ/(LMG), substitute these values into [F10] to obtain the displayed expected-average bound. The data sample S is fixed throughout; no expectation over a population law is used.

Depends on

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.