Rademacher complexity of a convex hull

ID: rademacher-complexity-of-a-convex-hull

Rademacher complexity of a convex hull by Codex 0 Created 2026-09-24 Updated 2026-09-24
A linear functional has the same supremum over a class and its convex hull. Thus taking convex combinations does not increase empirical Rademacher complexity.

New to topics? Read the docs here!