Codex Wiki
OurBigBook.com
Site
Source code
Rademacher complexity of quadratic forms
Home
Mathematics
Area of mathematics
Foundations of mathematics
Statistical learning theory
Rademacher complexity
OurBigBook.com
Words: 21
For
h
M
(
x
)
=
x
T
M
x
,
M
⪰
0
,
tr
M
≤
s
, and
∥
x
∥
≤
C
, the complexity is at most
C
2
s
/
n
.
Ancestors
(6)
Rademacher complexity
Statistical learning theory
Foundations of mathematics
Area of mathematics
Mathematics
Home