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 , widths , output size , and activations as in the spectral-network-complexity definition. Let , , and reference matrices be such that the class is nonempty. Let be any Borel probability measure on , let be an independent identically distributed sample from with , and fix and . Define the ramp-loss class With probability at least over , every satisfies where is the one-sided empirical Rademacher complexity with 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 .
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.
Scores are formed by finite matrix layers and zero-origin Lipschitz activations; the margin is the finite minimum , and the ramp loss takes values in . Spectral network complexity with reference matrices Multiclass margins, ramp loss, and empirical margin loss
Closed bounded subsets of finite-dimensional real Euclidean space are compact. Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
For bounded pointwise-convergent measurable functions, dominated convergence passes the limit through the probability integral. Dominated convergence
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
The axiom of choice permits choosing one point from every nonempty member of a countable family of sets. The Axiom of Choice
If changing one independent coordinate changes a bounded measurable statistic by at most , McDiarmid's inequality bounds each of its upper and lower tails by ; the lower-tail bound follows by applying the upper-tail bound to the negative statistic. McDiarmid bounded-differences inequality
The empirical Rademacher complexity is the expectation over independent uniform signs of the supremum of the normalized signed sample averages. One-sided Rademacher complexity
The rationals are dense in the reals: every nonempty open real interval contains a rational. Both and are dense in , and every nonempty open subset of is uncountable
Proof
Let be the set of all feasible tuples . The mixed-norm constraints are closed because each is a finite sum of continuous Euclidean column norms. For each layer, is the intersection, over all unit vectors , of the closed conditions , by the induced-operator-norm definition. Each column then has norm at most , so all matrix entries are bounded. Hence is closed and bounded in finite-dimensional Euclidean space and is compact by [F2].
For fixed , 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 the loss is continuous. If , these losses converge pointwise in and are bounded by one, so [F3] shows that is continuous. Each empirical loss and each finite signed sum of losses is also continuous in .
Identify the parameter tuples with , where . The balls with and form a countable family: each rational is a quotient of an integer by a positive integer, the integers have the enumeration , and finite tuples of natural numbers are enumerated by iterating the diagonal pairing . They form a base because for any open and , choose with , then use [F9] in each coordinate interval to choose with . Use [F9] again to choose a rational with (a nonempty interval with positive upper endpoint); then . 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 because the scores are continuous in , the margin is a finite minimum of continuous score-coordinate differences, and the label set is finite. These countable suprema are therefore measurable.
Write . Let be an independent ghost sample from . By the integral identities in [F4] and the inequality , where . Swapping each iid pair leaves its law unchanged; introducing independent uniform signs therefore leaves this expectation unchanged when each difference is multiplied by . The supremum of a sum is at most the sum of the suprema, and symmetry of the signs gives .
Replacing one sample coordinate changes by at most , since every loss lies in ; it also changes by at most , by [F7] and the same range bound. Apply the upper-tail bound [F6] to and to , each with failure probability and . Outside a set of probability at most , both and . Combining with step 4.1 gives .
If the predicted label differs from , some competing score is at least the true-label score, so and . Hence the zero-one loss is pointwise at most the ramp loss. Also for every real , so empirical ramp risk is at most empirical margin loss. Apply the definition of and step 5.1 to conclude the stated bound for every simultaneously.
Depends on
- Multiclass margins, ramp loss, and empirical margin loss
- Spectral network complexity with reference matrices
- One-sided Rademacher complexity
- Identical distribution and IID families
- Probability measures and probability spaces
- The Axiom of Choice
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Both $\mathbb{Q}$ and $\mathbb{R} \setminus \mathbb{Q}$ are dense in $\mathbb{R}$, and every nonempty open subset of $\mathbb{R}$ is uncountable
- McDiarmid bounded-differences inequality
- Dominated convergence
- The product sigma-algebra and its finite iterates
- Independent random elements have product joint law
- Change of variables for expectation
- Basic identities for a probability measure
- The natural logarithm as the inverse of the exponential function
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
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
- Peter L. Bartlett, Dylan J. Foster, and Matus Telgarsky, Spectrally-normalized margin bounds for neural networks, Appendix A.2 (standard reference, not scraped)
- Mehryar Mohri, Foundations of Machine Learning, Lecture 3, pp. 4–9 (standard reference, not scraped)