Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 hΦ∗. Let s≥1 and c>0. Suppose for every x, ∣η(x)−12∣s≤c [LΦ(x,0)−LΦ(x,hΦ∗(x))]. Then every measurable real-valued score h with finite surrogate risk satisfies the sound zero-score-is-error bound R01(h)−R01∗≤2c1/s[LΦ(h)−LΦ∗]1/s+E ⁣[min⁡{η(X),1−η(X)}1{h(X)=0}].

In particular, if P(h(X)=0)=0, the correction vanishes. Define instead the label classifier fh(x)=+1 for h(x)≥0 and fh(x)=−1 for h(x)<0, and write R+(h)=P(fh(X)≠Y). For all scores covered above, including scores with zeros, R+(h)−R01∗≤2c1/s[LΦ(h)−LΦ∗]1/s. Equivalently, parameterizing the same margin premise by ∣η(x)−1/2∣s≤as[LΦ(x,0)−LΦ(x,hΦ∗(x))] gives coefficient 2a in both inequalities, with the same zero-score correction when using R01.

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 Y∈{−1,+1}, the selected conditional probability function η, a finite convex nondecreasing margin loss Φ, its measurable extended-real conditional minimizer hΦ∗, s≥1, c>0, the displayed margin hypothesis, and a measurable real-valued score h with LΦ(h)<∞.

[A1]

Assume AC; it supplies the conditional-probability version used to define η. The Axiom of Choice A finite label has a conditional probability function

[F1]

The conditional class probabilities satisfy the event-integral identities for all measurable feature events. A finite label has a conditional probability function

[F2]

The conditional loss is LΦ(x,u)=η(x)Φ(−u)+(1−η(x))Φ(u); hΦ∗(x) minimizes it over the extended real line; R01 uses Yh≤0 and LΦ(h) is the population risk of Φ(−Yh). Binary surrogate classification risk Population and empirical risk

[F3]

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

[F4]

A finite convex real function on R is continuous. A convex function on an open convex set is continuous

[F5]

For nonnegative integrable D and convex φ(t)=−t1/s on [0,∞), Jensen gives E[D1/s]≤(ED)1/s. The negative reciprocal-power function is convex Jensen's inequality for expectation

[F6]

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

[F7]

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

[F8]

The nonnegative integral is additive on nonnegative measurable functions. Additivity of the nonnegative Lebesgue integral

[F9]

A nonnegative measurable function with finite integral is finite almost everywhere. A nonnegative measurable function with finite integral is finite almost everywhere

[F10]

The nonnegative integral of a measurable function over a null set is zero. A nonnegative integral over a null set vanishes

[F11]

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

1.1A1F1F3algebra

Under AC [A1], the event identities [F1] imply, first for indicators and finite nonnegative simple functions and then by [F3] for every nonnegative measurable f:X→[0,∞], that E[1{Y=+1}f(X)]=E[η(X)f(X)],E[1{Y=−1}f(X)]=E[(1−η(X))f(X)]. For simple f this follows by finite additivity of the event identities; increasing simple approximation and monotone convergence give the general case.

2.1F2F4F7step 1.1

The function Φ is continuous by [F4], hence Borel; its endpoint extension by one-sided limits is Borel on the extended real line. Since h is measurable, the measurable-map definition [F7] makes Φ∘h and Φ∘(−h) measurable and nonnegative. Applying step 1.1 to these functions gives LΦ(h)=E[LΦ(X,h(X))]. This identity also verifies measurability of the conditional-risk integrand used below.

3.1F2F7F8F9F10step 2.1givenalgebra

Put m(x)=LΦ(x,hΦ∗(x)) and g(x)=LΦ(x,0)−m(x). Minimality gives 0≤m(x)≤LΦ(x,0)=Φ(0) and g(x)≥0 for every x, so LΦ∗=Em(X)<∞. Here m is measurable: for the endpoint-valued minimizer, each weighted term is the limit of the measurable functions η(x)min⁡{Φ(−hΦ∗(x)),n} or (1−η(x))min⁡{Φ(hΦ∗(x)),n}, respectively; this also implements 0⋅∞=0. For the score h, put R(x)=LΦ(x,h(x)) and D0(x)=R(x)−m(x)≥0. By step 2.1, ER(X)=LΦ(h), while R=D0+m pointwise because m is finite. Additivity [F8] gives ED0(X)=LΦ(h)−LΦ∗<∞. By [F9], N={D0=+∞} is measurable and null. Set D=D0 on Nc and D=0 on N; [F7] makes this finite representative measurable. Additivity [F8] and [F10] show that it has ED=ED0=LΦ(h)−LΦ∗.

4.1F2step 3.1givenalgebra

Fix x, write a=η(x), and let u be a real score satisfying u(a−1/2)≤0. For all real u, convexity gives Φ(−u)+Φ(u)−2Φ(0)≥0. If a>1/2 then u≤0, so monotonicity gives Φ(−u)−Φ(u)≥0; if a<1/2 then u≥0, so Φ(−u)−Φ(u)≤0. The identity LΦ(x,u)−LΦ(x,0)=12[Φ(−u)+Φ(u)−2Φ(0)]+(a−12)[Φ(−u)−Φ(u)] therefore shows LΦ(x,u)≥LΦ(x,0) whenever a≠1/2 and u(a−1/2)≤0. When a=1/2, the same identity has zero second term and proves LΦ(x,u)≥LΦ(x,0) for every u, so the conditional minimum is at 0 and g(x)=0. Consequently, on {h(x)(a−1/2)≤0}∖N one has D(x)=D0(x)≥g(x)≥0; the excluded set is null.

5.1F2F6F8F10F11step 3.1step 4.1givenalgebra

Almost surely on the event h(X)(η(X)−1/2)≤0, we are outside the null set N from step 3.1, so the margin hypothesis and step 4.1 give ∣η(X)−1/2∣s≤cg(X)≤cD(X), hence ∣η(X)−1/2∣≤c1/sD(X)1/s. For nonnegative measurable integrands, [F8] and [F10] identify each full expectation with its integral on Nc; on that set the displayed inequality is pointwise, so monotonicity and positive-scalar homogeneity [F11] pass it to expectations and extract the factor 2c1/s. Apply the exact excess identity [F6], bound its first integrand in this way, and use 1{h=0}≤1 to obtain R01(h)−R01∗≤2c1/sE[D(X)1/s]+E[min⁡{η(X),1−η(X)}1{h(X)=0}].

6.1F5F8F11step 3.1step 5.1algebra

Put α=1/s∈(0,1]. For 0≤t≤1, tα≤1, while for t≥1, tα≤t; hence Dα≤1+D. Monotonicity [F11] and additivity [F8] give E[Dα]≤E[1+D]=1+ED<∞ by step 3.1, so Dα is integrable. By [F5], Jensen applied to the integrable convex function −tα gives E[D1/s]≤(ED)1/s=[LΦ(h)−LΦ∗]1/s by step 3.1. Substitution in step 5.1 proves the zero-score-is-error bound.

7.1F1F2step 5.1step 6.1algebra∎

Under P(h(X)=0)=0 the correction has expectation zero. For the label classifier fh, at each x its conditional excess over min⁡(η(x),1−η(x)) is 2∣η(x)−1/2∣ on {h(x)<0,η(x)>1/2}∪{h(x)≥0,η(x)<1/2} and zero elsewhere. This follows by comparing the conditional error η(x) for prediction −1 and 1−η(x) for prediction +1. This adverse-sign set is contained in the event of step 5.1, so steps 5.1 and 6.1 bound its expectation by 2c1/s[LΦ(h)−LΦ∗]1/s without a tie correction. Finally, replacing c by as makes c1/s=a and proves the equivalent source parameterization.

Source notes

Mohri et al. Theorem 4.7 assumes the margin right-hand side is cs[LΦ(x,0)−LΦ(x,hΦ∗(x))] to obtain coefficient 2c. The controlling plan instead has c there, which yields 2c1/s. The source classifier predicts +1 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 2c is false: a deterministic positive label with natural-log logistic loss, s=2, c=1/2, and score h=−0.1 satisfies its premise but has excess classification error 1>ln⁡(1+e0.1). Independently, at η=1/2 the zero score has surrogate excess zero and zero-score-is-error excess 1/2, 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 +1 tie rule; only its valid upper bound is used here, proved directly in step 7.1.

Depends on

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