Rademacher complexity

In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness of a class of real-valued functions with respect to a probability distribution.

Definitions

Rademacher complexity of a set

Given a set $A\subseteq \mathbb^m$, the Rademacher complexity of ''A'' is defined as follows:Chapter 26 in
:
\operatorname(A)
:=
\frac
\mathbb_\sigma \left \sup_
\sum_^m \sigma_i a_i
\right

where $\sigma_1, \sigma_2, \dots, \sigma_m$ are independent random variables drawn from the Rademacher distribution i.e. $\Pr(\sigma_i = +1) = \Pr(\sigma_i = -1) = 1/2$ for $i=1,2,\dots,m$, and $a=(a_1, \ldots, a_m)$. Some authors take the absolute value of the sum before taking the supremum, but if $A$ is symmetric this makes no difference.

Rademacher complexity of a function class

Let $S=(z_1, z_2, \dots, z_m) \in Z^m$ be a sample of points and consider a function class $\mathcal$ of real-valued functions over $Z^m$. Then, the empirical Rademacher complexity of $\mathcal$ given $S$ is defined as:
:
\operatorname_S(\mathcal)
=
\frac
\mathbb_\sigma \left \sup_
\sum_^m \sigma_i f(z_i)
\right

This can also be written using the previous definition:
:$\operatorname_S(F) = \operatorname(F \circ S)$
where $F \circ S$ denotes function composition, i.e.:
:$F \circ S := \$

Let $P$ be a probability distribution over $Z$.
The Rademacher complexity of the function class $F$ with respect to $P$ for sample size $m$ is:

:
\operatorname_(F)
:=
\mathbb_ \left \operatorname_S(F) \right

where the above expectation is taken over an identically independently distributed (i.i.d.) sample $S=(z_1, z_2, \dots, z_m)$ generated according to $P$.

Intuition

The Rademacher complexity is typically applied on a function class of models that are used for classification, with the goal of measuring their ability to classify points drawn from a probability space under arbitrary labellings. When the function class is rich enough, it contains functions that can appropriately adapt for each arrangement of labels, simulated by the random draw of $\sigma_i$ under the expectation, so that this quantity in the sum is maximised.

Examples

1. $A$ contains a single vector, e.g., $A = \ \subset \mathbb^2$. Then:
:: $\operatorname(A) = \cdot \left(\cdot(a+b) + \cdot(a-b) + \cdot(-a+b) + \cdot(-a-b)\right) = 0$
The same is true for every singleton hypothesis class.

2. $A$ contains two vectors, e.g., $A = \ \subset \mathbb^2$. Then:
::
\begin
\operatorname(A) & = \cdot \left(\cdot\max(1+1, 1+2) + \cdot\max(1-1, 1-2) + \cdot \max(-1+1, -1+2) + \cdot\max(-1-1, -1-2)\right) \\ pt& = (3+0+1-2) =
\end

Using the Rademacher complexity

The Rademacher complexity can be used to derive data-dependent upper-bounds on the learnability of function classes. Intuitively, a function-class with smaller Rademacher complexity is easier to learn.

Bounding the representativeness

In machine learning, it is desired to have a training set that represents the true distribution of some sample data $S$. This can be quantified using the notion of representativeness. Denote by $P$ the probability distribution from which the samples are drawn. Denote by $H$ the set of hypotheses (potential classifiers) and denote by $F$ the corresponding set of error functions, i.e., for every hypothesis $h\in H$, there is a function $f_h\in F$, that maps each training sample (features,label) to the error of the classifier $h$ (note in this case hypothesis and classifier are used interchangeably). For example, in the case that $h$ represents a binary classifier, the error function is a 0–1 loss function, i.e. the error function $f_h$ returns 1 if $h$ correctly classifies a sample and 0 else. We omit the index and write $f$ instead of $f_h$ when the underlying hypothesis is irrelevant. Define:
:L_P(f) := \mathbb E_ (z)/math> – the expected error of some error function $f\in F$ on the real distribution $P$;
:$L_S(f) := \sum_^m f(z_i)$ – the estimated error of some error function $f\in F$ on the sample $S$.
The representativeness of the sample $S$, with respect to $P$ and $F$, is defined as:
:$\operatorname_P(F,S) := \sup_ (L_P(f) - L_S(f))$

Smaller representativeness is better, since it provides a way to avoid overfitting: it means that the true error of a classifier is not much higher than its estimated error, and so selecting a classifier that has low estimated error will ensure that the true error is also low. Note however that the concept of representativeness is relative and hence can not be compared across distinct samples.

The expected representativeness of a sample can be bounded above by the Rademacher complexity of the function class:
: \mathbb E_ operatorname_P(F,S)\leq 2 \cdot \mathbb E_ operatorname(F\circ S)/math>

Bounding the generalization error

When the Rademacher complexity is small, it is possible to learn the hypothesis class H using empirical risk minimization.

For example, (with binary error function), for every $\delta>0$, with probability at least $1-\delta$, for every hypothesis $h\in H$:
:$L_P(h) - L_S(h) \leq 2 \operatorname(F\circ S) + 4 \sqrt$

Bounding the Rademacher complexity

Since smaller Rademacher complexity is better, it is useful to have upper bounds on the Rademacher complexity of various function sets. The following rules can be used to upper-bound the Rademacher complexity of a set $A \subset \mathbb^m$.

1. If all vectors in $A$ are translated by a constant vector $a_0 \in \mathbb^m$, then Rad(''A'') does not change.

2. If all vectors in $A$ are multiplied by a scalar $c\in \mathbb$, then Rad(''A'') is multiplied by $, c,$.

3. $\operatorname(A+B) = \operatorname(A) + \operatorname(B)$.

4. (Kakade & Tewari Lemma) If all vectors in $A$ are operated by a Lipschitz function, then Rad(''A'') is (at most) multiplied by the Lipschitz constant of the function. In particular, if all vectors in $A$ are operated by a contraction mapping, then Rad(''A'') strictly decreases.

5. The Rademacher complexity of the convex hull of $A$ equals Rad(''A'').

6. (Massart Lemma) The Rademacher complexity of a finite set grows logarithmically with the set size. Formally, let $A$ be a set of $N$ vectors in $\mathbb^m$, and let $\bar$ be the mean of the vectors in $A$. Then:
:$\operatorname(A) \leq \max_ \, a-\bar\, \cdot$
In particular, if $A$ is a set of binary vectors, the norm is at most $\sqrt$, so:
:$\operatorname(A) \leq \sqrt$

Bounds related to the VC dimension

Let $H$ be a set family whose VC dimension is $d$. It is known that the growth function of $H$ is bounded as:
:for all $m>d+1$: $\operatorname(H,m)\leq (em/d)^d$
This means that, for every set $h$ with at most $m$ elements, $, H\cap h, \leq (em/d)^d$. The set-family $H\cap h$ can be considered as a set of binary vectors over $\mathbb^m$. Substituting this in Massart's lemma gives:
:$\operatorname(H\cap h) \leq$

With more advanced techniques ( Dudley's entropy bound and Haussler's upper bound) one can show, for example, that there exists a constant $C$, such that any class of $\$-indicator functions with Vapnik–Chervonenkis dimension $d$ has Rademacher complexity upper-bounded by $C\sqrt$.

Bounds related to linear classes

The following bounds are related to linear operations on $S$ – a constant set of $m$ vectors in $\mathbb^n$.

1. Define $A_2 = \ =$ the set of dot-products of the vectors in $S$ with vectors in the unit ball. Then:
:$\operatorname(A_2) \leq$

2. Define $A_1 = \ =$ the set of dot-products of the vectors in $S$ with vectors in the unit ball of the 1-norm. Then:
:$\operatorname(A_1) \leq \max_i\, x_i\, _\infty\cdot \sqrt$

Bounds related to covering numbers

The following bound relates the Rademacher complexity of a set $A$ to its external covering number – the number of balls of a given radius $r$ whose union contains $A$. The bound is attributed to Dudley.

Suppose $A\subset \mathbb^m$ is a set of vectors whose length (norm) is at most $c$. Then, for every integer $M>0$:
:$\operatorname(A) \leq + \cdot \sum_^M 2^\sqrt$

In particular, if $A$ lies in a ''d''-dimensional subspace of $\mathbb^m$, then:
:$\forall r>0: N^_r(A) \leq (2 c \sqrt/r)^d$
Substituting this in the previous bound gives the following bound on the Rademacher complexity:
:$\operatorname(A) \leq \cdot \bigg(\sqrt + 2\sqrt\bigg) = O\bigg(\bigg)$

Gaussian complexity

Gaussian complexity is a similar complexity with similar physical meanings, and can be obtained from the Rademacher complexity using the random variables $g_i$ instead of $\sigma_i$, where $g_i$ are Gaussian i.i.d. random variables with zero-mean and variance 1, i.e. $g_i \sim \mathcal(0,1)$. Gaussian and Rademacher complexities are known to be equivalent up to logarithmic factors.

Equivalence of Rademacher and Gaussian complexity

Given a set $A\subseteq\mathbb^n$ then it holds that:

$\frac \leq \text(A) \leq \sqrtG(A)$

Where $G(A)$ is the Gaussian Complexity of A

References

{{reflist
* Peter L. Bartlett, Shahar Mendelson (2002) ''Rademacher and Gaussian Complexities: Risk Bounds and Structural Results''. Journal of Machine Learning Research 3 463–482
* Giorgio Gnecco, Marcello Sanguineti (2008) ''Approximation Error Bounds via Rademacher's Complexity''. Applied Mathematical Sciences, Vol. 2, 2008, no. 4, 153–176

Machine learning
Measures of complexity