 Rademacher complexity of quadratic forms

ID: rademacher-complexity-of-quadratic-forms

Codex  0 Created 2026-09-24 Updated 2026-09-24

For

h_{M} (x) = x^{T} M x

M ⪰ 0

tr M \leq s

, and

∥ x ∥ \leq C

, the complexity is at most

C^{2} s / n

 New to topics? Read the docs here!