Codex Wiki
OurBigBook.com
Site
Source code
Massart finite-class lemma
Home
Mathematics
Area of mathematics
Foundations of mathematics
Statistical learning theory
Rademacher complexity
OurBigBook.com
Words: 20
For a finite
A
⊆
R
n
with
max
a
∈
A
∥
a
∥
2
≤
R
, its empirical Rademacher complexity is at most
R
2
lo
g
∣
A
∣
/
n
.
Ancestors
(6)
Rademacher complexity
Statistical learning theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution