Rademacher complexity of a convex hull
= Rademacher complexity of a convex hull
{c}
A linear functional has the same supremum over a class and its convex hull. Thus taking convex combinations does not increase empirical Rademacher complexity.
= Rademacher complexity of a convex hull
{c}
A linear functional has the same supremum over a class and its convex hull. Thus taking convex combinations does not increase empirical Rademacher complexity.