Beta. Content is under active construction and has not been peer-reviewed. Report errors on
GitHub
.
Disclaimer
Theorem
Path
Curriculum
Paths
Demos
Diagnostic
Search
Quiz Hub
/
Rademacher Complexity
Rademacher Complexity
8 questions
Difficulty 6-9
View topic
Intermediate
0 / 8
3 intermediate
5 advanced
Adapts to your performance
1 / 8
intermediate (6/10)
conceptual
Why is the empirical Rademacher complexity
R
^
S
(
H
)
=
E
σ
[
sup
h
∈
H
n
1
∑
i
=
1
n
σ
i
h
(
x
i
)
]
considered more informative than the VC dimension for bounding generalization?
Hide and think first
A.
Because it gives faster convergence rates (
1/
n
instead of
1/
n
)
B.
Because the empirical Rademacher complexity can always be computed in polynomial time, while VC dimension computation is NP-hard for most classes
C.
Because it is data-dependent, measuring the complexity of
H
restricted to the actual sample rather than worst-case
D.
Because it does not require the hypothesis class to have finite VC dimension
Submit Answer