Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Uniform margin-risk deviation from empirical Rademacher complexity

Statement

Assume the axiom of choice.

Fix a finite network architecture with L≥1, widths d0,…,dL≥1, output size K=dL≥2, and activations as in the spectral-network-complexity definition. Let si>0, bi≥0, and reference matrices Mi be such that the class F:={FA:∥Ai∥σ≤si, ∥Ai⊤−Mi⊤∥2,1≤bi for every i} is nonempty. Let D be any Borel probability measure on Rd0×{1,…,K}, let S=((x1,y1),…,(xn,yn)) be an independent identically distributed sample from D with n≥1, and fix γ>0 and 0<δ<1. Define the ramp-loss class Lγ:={(x,y)↦ℓγ(−mF(x,y)):F∈F}. With probability at least 1−δ over S, every F∈F satisfies L0(F)≤L^γ,S(F)+2R^S(Lγ)+3log⁡(2/δ)2n, where R^S is the one-sided empirical Rademacher complexity with 1/n normalization.

Statement references

Multiclass margins, ramp loss, and empirical margin loss: defines multiclass margin, ramp risk, zero-one risk, and empirical margin loss.

Spectral network complexity with reference matrices: fixes the network family and the layer constraints used to form F.

One-sided Rademacher complexity: fixes the one-sided empirical Rademacher convention and normalization.

Facts & Assumptions

Given: The compactly constrained network class, Borel probability measure, iid sample, fixed margin level, confidence parameter, and ramp-loss class in the Statement.

[F1]

Scores are formed by finite matrix layers and zero-origin Lipschitz activations; the margin is the finite minimum mF(x,y)=min⁡j≠y(F(x)y−F(x)j), and the ramp loss takes values in [0,1]. Spectral network complexity with reference matrices Multiclass margins, ramp loss, and empirical margin loss

[F3]

For bounded pointwise-convergent measurable functions, dominated convergence passes the limit through the probability integral. Dominated convergence

[F4]

Independent random elements have the product joint law, and change of variables transfers integrable product-law functions to expectations; these facts justify the independent ghost sample, pairwise swaps, and expectation identities. Identical distribution and IID families The product sigma-algebra and its finite iterates Independent random elements have product joint law Change of variables for expectation

[F5]

The axiom of choice permits choosing one point from every nonempty member of a countable family of sets. The Axiom of Choice

[F6]

If changing one independent coordinate changes a bounded measurable statistic by at most 1/n, McDiarmid's inequality bounds each of its upper and lower tails by exp⁡(−2nt2); the lower-tail bound follows by applying the upper-tail bound to the negative statistic. McDiarmid bounded-differences inequality

[F7]

The empirical Rademacher complexity is the expectation over independent uniform signs of the supremum of the normalized signed sample averages. One-sided Rademacher complexity

[F9]

The rationals are dense in the reals: every nonempty open real interval contains a rational. Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable

Proof

1.1F1F2givenalgebra

Let Θ be the set of all feasible tuples (A1,…,AL). The mixed-norm constraints are closed because each is a finite sum of continuous Euclidean column norms. For each layer, ∥Ai∥σ≤si is the intersection, over all unit vectors v, of the closed conditions ∥Aiv∥2≤si, by the induced-operator-norm definition. Each column Aiej then has norm at most si, so all matrix entries are bounded. Hence Θ is closed and bounded in finite-dimensional Euclidean space and is compact by [F2].

2.1F1F3step 1.1given

For fixed x, induction over the layers shows that the score vector depends continuously on the matrix tuple: matrix multiplication is jointly continuous and each Lipschitz activation is continuous. Finite maxima, coordinate differences, and the ramp preserve continuity, so for fixed (x,y) the loss A↦ℓγ(−mFA(x,y)) is continuous. If A(r)→A, these losses converge pointwise in (x,y) and are bounded by one, so [F3] shows that A↦Rγ(FA) is continuous. Each empirical loss and each finite signed sum of losses is also continuous in A.

3.1F1F5F9step 1.1step 2.1given

Identify the parameter tuples with Rp, where p:=∑i=1Ldidi−1. The balls B(q,r) with q∈Qp and r∈Q>0 form a countable family: each rational is a quotient of an integer by a positive integer, the integers have the enumeration 0,1,−1,2,−2,…, and finite tuples of natural numbers are enumerated by iterating the diagonal pairing π(a,b):=(a+b)(a+b+1)/2+b. They form a base because for any open O⊆Rp and x∈O, choose η>0 with B(x,η)⊆O, then use [F9] in each coordinate interval (xj−η/(4p),xj+η/(4p)) to choose q∈Qp with ∥q−x∥2<η/4. Use [F9] again to choose a rational r with ∥q−x∥2<r<η−∥q−x∥2 (a nonempty interval with positive upper endpoint); then x∈B(q,r)⊆B(x,η)⊆O. Intersecting these balls with Θ gives a countable base for its subspace topology. Using [F5], choose one point of Θ from each nonempty basic intersection; the selected countable subset is dense in Θ. By step 2.1, each supremum over Θ defining the uniform deviation or a signed empirical supremum equals the supremum over this countable dense subset. The losses are Borel in (x,y) because the scores are continuous in x, the margin is a finite minimum of continuous score-coordinate differences, and the label set is finite. These countable suprema are therefore measurable.

4.1F4F7step 3.1givenalgebra

Write Z(S):=sup⁡F∈F(Rγ(F)−R^γ,S(F)). Let S′ be an independent ghost sample from D. By the integral identities in [F4] and the inequality sup⁡FES′UF≤ES′sup⁡FUF, EZ(S)≤ES,S′sup⁡F∈F1n∑i=1n(ℓF(xi′,yi′)−ℓF(xi,yi)), where ℓF(x,y)=ℓγ(−mF(x,y)). Swapping each iid pair (zi,zi′) leaves its law unchanged; introducing independent uniform signs εi therefore leaves this expectation unchanged when each difference is multiplied by εi. The supremum of a sum is at most the sum of the suprema, and symmetry of the signs gives EZ(S)≤2ESR^S(Lγ).

5.1F6F7F8step 4.1givenalgebra

Replacing one sample coordinate changes Z(S) by at most 1/n, since every loss lies in [0,1]; it also changes R^S(Lγ) by at most 1/n, by [F7] and the same range bound. Apply the upper-tail bound [F6] to Z and to −R^S(Lγ), each with failure probability δ/2 and t=log⁡(2/δ)/(2n). Outside a set of probability at most δ, both Z(S)≤EZ(S)+t and ER^S(Lγ)≤R^S(Lγ)+t. Combining with step 4.1 gives Z(S)≤EZ(S)+t≤2ER^S(Lγ)+t≤2R^S(Lγ)+3t.

6.1F1step 5.1givenalgebra∎

If the predicted label differs from y, some competing score is at least the true-label score, so mF(x,y)≤0 and ℓγ(−mF(x,y))=1. Hence the zero-one loss is pointwise at most the ramp loss. Also ℓγ(−m)≤1{m≤γ} for every real m, so empirical ramp risk is at most empirical margin loss. Apply the definition of Z(S) and step 5.1 to conclude the stated bound for every F∈F simultaneously.

Depends on

Used by

Dependency tree · two levels

110 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