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.
One-sided Rademacher complexity
Definition
Let be a probability space and let be a nonempty class of -measurable functions . For a fixed sample , where , let be independent uniform signs in . Define
and define the empirical Rademacher complexity by
Here is the uniform average over the sign vectors. If is an IID sample with common law , and the displayed supremum is measurable as a function of , the expected Rademacher complexity is
The class may be finite, countable, or uncountable when the indicated supremum is measurable; a specified countable subclass giving the same supremum for every sign vector for almost every sample suffices. This is the one-sided convention: the definition contains no absolute value, and zero need not belong to . Both complexities lie in : every signed average lies in , and for any fixed the sign-average supremum is at least the sign-average for , which is zero.
Definition references
Probability measures and probability spaces: is a measure of total mass one on .
Empirical, centered, and Rademacher processes: defines the notation , and the one-sided Rademacher process.
One-sided empirical Rademacher complexity: uses the same nonabsolute sign supremum normalization for fixed samples and finite or countable classes.
Identical distribution and IID families: IID means mutually independent random elements with the same law.
Independent random elements have product joint law: identifies the joint law of a finite independent tuple with the product of its marginals, so an IID tuple with common law has law .
Mohri et al., Definitions 3.1–3.2, printed pp. 30–31: the adopted one-sided empirical and expected normalization.
Bartlett and Mendelson, Definition 2, printed p. 464: an independent treatment using an absolute supremum and a normalization, recorded for comparison.
Depends on
Used by
- ERM excess risk from Rademacher uniform deviation Corollary
- Latent-class contrastive representation learning Definition
- A two-function loss class has explicit Rademacher complexity Example
- Bounded linear predictors have a radius-dependent bound Example
- Clipping can make the linear radius bound loose Example
- Training accuracy, algorithmic stability, and class-wide Rademacher bounds Example
- A truncated covering integral bounds empirical Rademacher complexity Lemma
- Uniform margin-risk deviation from empirical Rademacher complexity Lemma
- One-sided Rademacher symmetrization bound Theorem
- Rademacher uniform generalization bounds Theorem
Dependency tree · two levels
16 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., Definitions 3.1–3.2 (standard reference, not scraped)
- Peter L. Bartlett and Shahar Mendelson, Rademacher and Gaussian Complexities: Risk Bounds and Structural Results, JMLR 3 (2002), Definition 2 (standard reference, not scraped)