OurBigBook
About
$
Donate
Sign in
Sign up
Rademacher complexity of quadratic forms
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
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
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