OurBigBook About$ Donate
 Sign in Sign up

Massart finite-class lemma

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Statistical learning theory Rademacher complexity
Created 2026-09-24 Updated 2026-10-03  0 By others on same topic  0 Discussions Create my own version
For a finite A⊆Rn with maxa∈A​∥a∥2​≤R, its empirical Rademacher complexity is at most R2log∣A∣​/n.

 Ancestors (6)

  1. Rademacher complexity
  2. Statistical learning theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / ii / Paper 1 / 31K / b / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook