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 be a measurable instance space, let the binary label space have its discrete sigma-algebra, and let be a finite nonempty class of measurable classifiers . For a probability law on , write for the population zero-one risk. A sample of size consists of independent observations with common law ; write for its empirical zero-one risk. The law is realizable by if some satisfies .
Put with its product sigma-algebra. For fixed , a deterministic learner is a measurable map , where the finite set has its discrete sigma-algebra. For a law on , let be an IID sample with common law , and write for probability under its joint law. For , the learner is -PAC realizable if, for every law realizable by , . It is agnostic -PAC if, for every law on , . A randomized learner uses a measurable probability space and a measurable output map , with a seed independent of ; in both criteria replace by and by the joint probability . 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
- Finite pool-based realizable active-learning instance Definition
- Measurable PAC learning criteria for a possibly infinite VC class Definition
- Duplicate predictors do not enlarge the finite class Example
- Finite lookup tables have explicit PAC sample bounds Example
- Zero training error can coexist with positive population risk Example
- Exact labels, slow version-space shrinkage, and abstention limits Remark
- Finite-class agnostic ERM bound Theorem
- Finite-class realizable and agnostic sample complexity Theorem
- Finite-class realizable PAC bound Theorem
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
- Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar, Foundations of Machine Learning, 2nd ed., Chapter 2 §§2.1–2.4 (standard reference, not scraped)
- Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to Algorithms, Chapters 2–4 (standard reference, not scraped)