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.
Empirical risk minimizers
Definition
Fix a sample and a nonempty class of predictors. Its empirical minimum is . An exact empirical risk minimizer is a predictor with . If the infimum is finite but is not attained, no exact minimizer exists. If the infimum is , nonemptiness implies that every member has infinite empirical risk and is an exact minimizer.
For finite , a predictor is an -approximate empirical risk minimizer if either the empirical minimum is and is an exact minimizer, or the empirical minimum is finite and has finite empirical risk at most . The membership requirement applies in both branches. Thus the definition never forms . When and the finite infimum is not attained, no such predictor exists.
For a fixed sample size , a measurable prediction rule with class is a jointly measurable evaluation map from the sample space and a new instance in to , whose slice at each sample belongs to . It is an exact or approximate ERM rule when every slice satisfies the corresponding samplewise definition above. This definition asserts no existence of a measurable selector for an arbitrary class.
Definition references
Supervised prediction problems: fixes the measurable observation and predictor spaces.
Population and empirical risk: defines the samplewise empirical risk being minimized.
Depends on
Used by
- Approximate empirical risk minimization with a supplied selector Algorithm
- Finite-list empirical risk minimization Algorithm
- ERM excess risk from Rademacher uniform deviation Corollary
- A nonattained risk infimum Example
- The finite-list ERM selector is measurable Lemma
- Finite-class agnostic ERM bound Theorem
- Finite-class realizable PAC bound Theorem
Dependency tree · two levels
10 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
- Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to Algorithms, Chapter 2 §2.2 and Chapter 3 §3.2.2 (standard reference, not scraped)
- Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar, Foundations of Machine Learning, 2nd ed., Chapter 2 §§2.1–2.2 (standard reference, not scraped)