Rademacher Complexity




Empirical Rademacher complexity


     G is a family of loss functions.


     The  hypothesis  class  is the class of halfspaces with con‐
straints: l1‐norm <= 1.

Find an upper bound for its empirical Rademacher complexity.