Codex Wiki
OurBigBook.com
Site
Source code
Expected excess-risk bound for empirical risk minimization
Home
Mathematics
Area of mathematics
Foundations of mathematics
Statistical learning theory
Rademacher complexity
OurBigBook.com
Words: 23
With the
1/
n
Rademacher convention, an empirical risk minimizer has expected excess risk at most twice the Rademacher complexity of its loss class.
Ancestors
(6)
Rademacher complexity
Statistical learning theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution