Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Cross-validation splits and training-size risk targets

Definition

Let (Z,F) be a measurable sample space with probability law P. For each training size k≥1, a learning rule is a measurable map Ak:Zk→(H,G), where (H,G) is a measurable predictor space. This is a statistic in the sense of Statistics and estimators. Let L:H×Z→R be jointly measurable and assume L(Ak(Z1,…,Zk),Zk+1) is integrable under P⊗(k+1) for every size used. The convention that risk is expected loss agrees with Loss functions and risk for nonnegative losses; the integrable real-valued case is used here as well. The product law is the joint law of independent observations by Independent random elements have product joint law.

The risk at training size k is

Rk:=EP⊗(k+1) ⁣[L(Ak(Z1,…,Zk),Zk+1)],

where Zk+1 is independent of the training sample. A split of [n]:={1,…,n} is a pair (T,V) of disjoint nonempty sets with T∪V=[n]; T is the training index set and V is the validation index set. For a fixed partition I1,…,IK of [n] into nonempty folds with K≥2, the equal-observation-weight cross-validation score is

R^CV:=1n∑j=1K∑i∈IjL(An−∣Ij∣(ZIjc),Zi),

where each training tuple ZIjc is ordered by increasing index and Ijc=[n]∖Ij. The risk corresponding to this design is the weighted training-size target ∑j=1K(∣Ij∣/n)Rn−∣Ij∣. For equal folds of size m, this target is Rn−m; it is not automatically Rn, the risk after training on all n observations.

Depends on

Used by

Dependency tree · two levels

18 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