Codex Wiki
OurBigBook.com
Site
Source code
Rademacher bound for bounded weighted indicators
Home
Mathematics
Area of mathematics
Foundations of mathematics
Statistical learning theory
Rademacher complexity
OurBigBook.com
Words: 39
For
∣
D
i
∣
≤
M
and a binary class
H
of VC dimension at most
p
, the vectors
(
D
i
h
(
X
i
)
)
i
=
1
n
have norm at most
M
n
and at most
(
n
+
1
)
p
distinct values. The Massart finite-class lemma gives
R
≤
M
n
2
p
l
o
g
(
n
+
1
)
.
(82)
Ancestors
(6)
Rademacher complexity
Statistical learning theory
Foundations of mathematics
Area of mathematics
Mathematics
Home