Search results with tag "Rademacher"

1 Rademacher Complexity - Carnegie Mellon School of ...

Rademacher complexity is a more modern notion of complexity that is distribution dependent and de ned for any class real-valued functions (not only discrete-valued functions). 1.2 De nitions Given a space Zand a xed distribution Dj Z, let S= fz 1;:::;z mgbe a set of examples drawn i.i.d. from Dj Z. Furthermore, let Fbe a class of functions f: Z!R.

  Complexity, 1 rademacher complexity, Rademacher, Rademacher complexity