Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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.

The unadjusted surrogate-regret bound has the wrong scale and tie convention

Statement

The following proposed implication is false. In the binary-surrogate setup, take R01(h)=P(Yh(X)≤0), so zero scores count as errors. If s≥1,c>0 and for every x, ∣η(x)−1/2∣s≤c[LΦ(x,0)−LΦ(x,hΦ∗(x))], then every measurable real-valued score h with finite surrogate risk satisfies R01(h)−R01∗≤2c[LΦ(h)−LΦ∗]1/s. Even replacing 2c by 2c1/s does not make this zero-remainder implication true under the stated zero-score-is-error convention.

Statement references

Binary surrogate classification risk: specifies the full convex nondecreasing nonnegative margin-loss setup, extended conditional minimizer, and both risks.

Facts & Assumptions

Given: The proposed implication and the zero-score-is-error convention in the statement.

[F1]

The conditional risk is LΦ(x,u)=η(x)Φ(−u)+(1−η(x))Φ(u) and R01∗=Emin⁡(η,1−η). Binary surrogate classification risk

Refutation

1.1F1constructalgebra

Give the one-point feature space its power-set sigma-algebra and take Y=+1 surely. Let Φ(t)=max⁡(0,1+t), a finite nonnegative nondecreasing convex function: each affine term is nondecreasing and their maximum satisfies the convexity inequality by bounding each affine term at a convex combination by the corresponding convex combination of the two maxima. Here η=1, LΦ(x,u)=max⁡(0,1−u), and the constant minimizer hΦ∗=1 has risk zero. With s=2,c=1/4, the margin premise is 1/4≤(1/4)(1−0), an equality. For h=−1/2, classification excess is 1 and surrogate excess is 3/2, whereas the claimed bound is (1/2)3/2<1 since its square is 3/8<1. All scores and risks are measurable and finite. Thus the proposed coefficient is false even without zero scores and with a finite conditional minimizer.

2.1F1constructstep 1.1algebra∎

Independently use the same one-point feature space and hinge loss, but let each label have probability 1/2. Then LΦ(x,u)=[max⁡(0,1−u)+max⁡(0,1+u)]/2≥1, with equality at u=0, so take hΦ∗=h=0. For s=1,c=1 the premise is 0≤0 and surrogate excess is zero. But R01(h)=1 while R01∗=1/2, so classification excess is 1/2. Both 2c and 2c1/s times the zero surrogate excess vanish. This refutes the uncorrected tie convention independently of the scale defect and completes the refutation.

Source notes

The displayed false implication preserves the controlling ML-07 formula exactly. Mohri et al. Theorem 4.7 instead puts cs in its premise and predicts +1 at a zero score. Its regret theorem remains sound using an upper bound in place of its Lemma 4.5 equality at zero. The two witnesses here use the same approved class of losses and do not rely on any endpoint, selection, or limiting assumption.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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