OurBigBook
About
$
Donate
Sign in
Sign up
Rademacher bound for bounded weighted indicators
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Statistical learning theory
Rademacher complexity
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
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
)
.
(1)
Ancestors
(6)
Rademacher complexity
Statistical learning theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
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