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.

Realizable and agnostic PAC learning

Definition

Let (X,ΣX) be a measurable instance space, let the binary label space {0,1} have its discrete sigma-algebra, and let H be a finite nonempty class of measurable classifiers h:X→{0,1}. For a probability law P on X×{0,1}, write RP(h)=P{(x,y):h(x)≠y} for the population zero-one risk. A sample of size m≥1 consists of m independent observations with common law P; write R^S(h)=m−1∑i=1m1{h(Xi)≠Yi} for its empirical zero-one risk. The law P is realizable by H if some h∗∈H satisfies RP(h∗)=0.

Put Z=X×{0,1} with its product sigma-algebra. For fixed m≥1, a deterministic learner is a measurable map A:Zm→H, where the finite set H has its discrete sigma-algebra. For a law P on Z, let S=(Z1,…,Zm) be an IID sample with common law P, and write PS for probability under its joint law. For 0<ϵ,δ<1, the learner is (ϵ,δ)-PAC realizable if, for every law P realizable by H, PS{RP(A(S))≤ϵ}≥1−δ. It is agnostic (ϵ,δ)-PAC if, for every law P on Z, PS{RP(A(S))−inf⁡h∈HRP(h)≤ϵ}≥1−δ. A randomized learner uses a measurable probability space (U,ΣU,Q) and a measurable output map A:Zm×U→H, with a seed U∼Q independent of S; in both criteria replace A(S) by A(S,U) and PS by the joint probability PS,U. All risks and the infimum are finite because the zero-one loss is bounded by one. These definitions impose no computational-efficiency claim.

Definition references

Supervised prediction problems: a supervised problem specifies measurable instance and label spaces, a joint law, measurable predictors, and a measurable loss.

Population and empirical risk: population risk is the expected loss and empirical risk is the sample average of that loss.

Identical distribution and IID families: IID observations are mutually independent and have the same law.

Depends on

Used by

Dependency tree · two levels

13 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