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.
Absolute loss and conditional medians
Example
Let , with discrete sigma-algebras, with its Borel sigma-algebra, and the set of all predictors from to . Give the joint law by and define the label coordinate . Use absolute loss . A median of a probability law on is a value satisfying both and . The conditional law of at the only instance assigns probability to each of and , so every is a median. The predictors for all minimize population risk, with risk ; every predictor with value outside has risk greater than .
Facts & Assumptions
Given: The finite measurable spaces, joint law, absolute loss and predictor class stated in the example.
A supervised problem specifies the measurable spaces, joint law, predictor class and loss. Supervised prediction problems
Population risk is the integral of the nonnegative loss under the joint law. Population and empirical risk
Verification
The only instance has probability one, so for a predictor with value the population risk is .
If , this risk is ; if , it is ; and if , it is . Thus its minimizers are exactly . For each such , both median inequalities hold with probability at least ; outside this interval one of the inequalities fails.
Depends on
Used by
Nothing in the library uses this result yet.
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 3 §3.2.2 (standard reference, not scraped)