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.
Surrogate regret controls classification regret with explicit tie and scale terms
Statement
Assume AC and the binary-surrogate setup, including a measurable extended-real conditional minimizer . Let and . Suppose for every , Then every measurable real-valued score with finite surrogate risk satisfies the sound zero-score-is-error bound
In particular, if , the correction vanishes. Define instead the label classifier for and for , and write . For all scores covered above, including scores with zeros, Equivalently, parameterizing the same margin premise by gives coefficient in both inequalities, with the same zero-score correction when using .
Statement references
Binary surrogate classification risk: defines , the conditional margin risk, its minimizer, and the surrogate and classification risks.
Binary zero-one excess risk with a zero-score error convention: gives the exact classification-risk excess under the convention that zero scores are errors.
The negative reciprocal-power function is convex: supplies the convexity needed for the reciprocal-power Jensen step.
Facts & Assumptions
Given: AC, a binary supervised problem with , the selected conditional probability function , a finite convex nondecreasing margin loss , its measurable extended-real conditional minimizer , , , the displayed margin hypothesis, and a measurable real-valued score with .
Assume AC; it supplies the conditional-probability version used to define . The Axiom of Choice A finite label has a conditional probability function
The conditional class probabilities satisfy the event-integral identities for all measurable feature events. A finite label has a conditional probability function
The conditional loss is ; minimizes it over the extended real line; uses and is the population risk of . Binary surrogate classification risk Population and empirical risk
A nonnegative measurable function admits increasing simple approximations, and monotone convergence passes their integrals to the limit. Every nonnegative measurable function is the increasing limit of simple measurable functions Monotone convergence for the integral
A finite convex real function on is continuous. A convex function on an open convex set is continuous
For nonnegative integrable and convex on , Jensen gives . The negative reciprocal-power function is convex Jensen's inequality for expectation
The exact binary classification-risk excess is the sum of the wrong-sign term and the zero-score correction displayed in the risk-excess lemma. Binary zero-one excess risk with a zero-score error convention
Measurability is preserved by composition with Borel maps and by defined arithmetic operations on measurable extended-real functions. A measurable function between measurable spaces Arithmetic and lattice operations preserve measurability whenever they are defined
The nonnegative integral is additive on nonnegative measurable functions. Additivity of the nonnegative Lebesgue integral
A nonnegative measurable function with finite integral is finite almost everywhere. A nonnegative measurable function with finite integral is finite almost everywhere
The nonnegative integral of a measurable function over a null set is zero. A nonnegative integral over a null set vanishes
The nonnegative integral is monotone for pointwise ordered nonnegative measurable functions and homogeneous under positive finite real scalars. Monotonicity and nonnegative homogeneity of the nonnegative integral
Proof
Under AC [A1], the event identities [F1] imply, first for indicators and finite nonnegative simple functions and then by [F3] for every nonnegative measurable , that For simple this follows by finite additivity of the event identities; increasing simple approximation and monotone convergence give the general case.
The function is continuous by [F4], hence Borel; its endpoint extension by one-sided limits is Borel on the extended real line. Since is measurable, the measurable-map definition [F7] makes and measurable and nonnegative. Applying step 1.1 to these functions gives This identity also verifies measurability of the conditional-risk integrand used below.
Put and . Minimality gives and for every , so . Here is measurable: for the endpoint-valued minimizer, each weighted term is the limit of the measurable functions or , respectively; this also implements . For the score , put and . By step 2.1, , while pointwise because is finite. Additivity [F8] gives . By [F9], is measurable and null. Set on and on ; [F7] makes this finite representative measurable. Additivity [F8] and [F10] show that it has .
Fix , write , and let be a real score satisfying . For all real , convexity gives . If then , so monotonicity gives ; if then , so . The identity therefore shows whenever and . When , the same identity has zero second term and proves for every , so the conditional minimum is at and . Consequently, on one has ; the excluded set is null.
Almost surely on the event , we are outside the null set from step 3.1, so the margin hypothesis and step 4.1 give , hence . For nonnegative measurable integrands, [F8] and [F10] identify each full expectation with its integral on ; on that set the displayed inequality is pointwise, so monotonicity and positive-scalar homogeneity [F11] pass it to expectations and extract the factor . Apply the exact excess identity [F6], bound its first integrand in this way, and use to obtain
Put . For , , while for , ; hence . Monotonicity [F11] and additivity [F8] give by step 3.1, so is integrable. By [F5], Jensen applied to the integrable convex function gives by step 3.1. Substitution in step 5.1 proves the zero-score-is-error bound.
Under the correction has expectation zero. For the label classifier , at each its conditional excess over is on and zero elsewhere. This follows by comparing the conditional error for prediction and for prediction . This adverse-sign set is contained in the event of step 5.1, so steps 5.1 and 6.1 bound its expectation by without a tie correction. Finally, replacing by makes and proves the equivalent source parameterization.
Source notes
Mohri et al. Theorem 4.7 assumes the margin right-hand side is to obtain coefficient . The controlling plan instead has there, which yields . The source classifier predicts at zero, while the plan counts zero as an error; the exact local risk identity therefore requires the displayed zero-score correction. The original planned zero-remainder formula with coefficient is false: a deterministic positive label with natural-log logistic loss, , , and score satisfies its premise but has excess classification error . Independently, at the zero score has surrogate excess zero and zero-score-is-error excess , so changing only the coefficient cannot repair that convention. The corrected general bound and both clean specializations above retain the complete planned surrogate scope. Mohri Lemma 4.5 overcounts at zero under its own tie rule; only its valid upper bound is used here, proved directly in step 7.1.
Depends on
- Binary surrogate classification risk
- Binary zero-one excess risk with a zero-score error convention
- A finite label has a conditional probability function
- Population and empirical risk
- Jensen's inequality for expectation
- The negative reciprocal-power function is convex
- The Axiom of Choice
- Every nonnegative measurable function is the increasing limit of simple measurable functions
- Monotone convergence for the integral
- Additivity of the nonnegative Lebesgue integral
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- A nonnegative measurable function with finite integral is finite almost everywhere
- A nonnegative integral over a null set vanishes
- A convex function on an open convex set is continuous
- A measurable function between measurable spaces
- Arithmetic and lattice operations preserve measurability whenever they are defined
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
57 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, Theorem 4.7 and proof, printed pp. 76–77 (PDF pp. 93–94) (standard reference, not scraped)
- Rick Durrett, Probability: Theory and Examples, 5th ed., Sections 1.6.1 and 4.1 (standard reference, not scraped)