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.
Binary surrogate classification risk
Definition
Let be the label in a supervised prediction problem with the full power-set sigma-algebra on this binary label set, and choose the finite-label conditional probability function ordered as ; write . Let be finite, convex and nondecreasing. It is continuous on ; extend it to by its one-sided monotone limits, which may equal . The resulting extended function is Borel measurable. For define the conditional margin risk using at endpoints. A measurable extended-real conditional minimizer is a measurable satisfying for every and every . For a measurable real-valued score , its margin loss is , its surrogate risk is , and its conditional-minimum risk is . Under the zero-score-is-error convention, its classification risk is , and the Bayes classification risk is . Write for the centered conditional class probability.
Definition references
Supervised prediction problems: fixes the measurable instance and label spaces and joint law.
A finite label has a conditional probability function: the chosen is a measurable version whose event integrals give the conditional label probabilities.
Population and empirical risk: population risk is an extended nonnegative integral of the loss under the joint law.
Loss functions and risk: fixes the loss and risk conventions used for the margin loss.
A measurable function between measurable spaces: a function is measurable when preimages of measurable sets are measurable.
A convex function on an open convex set is continuous: every finite convex function on the open convex set is continuous.
Depends on
Used by
Dependency tree · two levels
23 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 4, Section 4.7, printed pp. 75–77 (PDF pp. 92–94) (standard reference, not scraped)
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 4.1 (standard reference, not scraped)