In statistical learning theory, a learnable function class is a set of functions for which an algorithm can be devised to asymptotically minimize the expected risk, uniformly over all probability distributions. The concept of learnable classes are closely related to regularization in machine learning, and provides large sample justifications for certain learning algorithms.
Let
Ω
=
X
×
Y
=
{
(
x
,
y
)
}
be the sample space, where
y
are the labels and
x
are the covariates (predictors).
F
=
{
f
:
X
↦
Y
}
is a collection of mappings (functions) under consideration to link
x
to
y
.
L
:
Y
×
Y
↦
R
is a pre-given loss function (usually non-negative). Given a probability distribution
P
(
x
,
y
)
on
Ω
, define the expected risk
I
P
(
f
)
to be:
I
P
(
f
)
=
∫
L
(
f
(
x
)
,
y
)
d
P
(
x
,
y
)
The general goal in statistical learning is to find the function in
F
that minimizes the expected risk. That is, to find solutions to the following problem:
f
^
=
arg
min
f
∈
F
I
P
(
f
)
But in practice the distribution
P
is unknown, and any learning task can only be based on finite samples. Thus we seek instead to find an algorithm that asymptotically minimizes the empirical risk, i.e., to find a sequence of functions
{
f
^
n
}
n
=
1
∞
that satisfies
lim
n
→
∞
P
(
I
P
(
f
^
n
)
−
inf
f
∈
F
I
P
(
f
)
>
ϵ
)
=
0
One usual algorithm to find such a sequence is through empirical risk minimization.
We can make the condition given in the above equation stronger by requiring that the convergence is uniform for all probability distributions. That is:
The intuition behind the more strict requirement is as such: the rate at which sequence
{
f
^
n
}
converges to the minimizer of the expected risk can be very different for different
P
(
x
,
y
)
. Because in real world the true distribution
P
is always unknown, we would want to select a sequence that performs well under all cases.
However, by the no free lunch theorem, such a sequence that satisfies (1) does not exist if
F
is too complex. This means we need to be careful and not allow too "many" functions in
F
if we want (1) to be a meaningful requirement. Specifically, function classes that ensure the existence of a sequence
{
f
^
n
}
that satisfies (1) are known as learnable classes.
It is worth noting that at least for supervised classification and regression problems, if a function class is learnable, then the empirical risk minimization automatically satisfies (1). Thus in these settings not only do we know that the problem posed by (1) is solvable, we also immediately have an algorithm that gives the solution.
If the true relationship between
y
and
x
is
y
∼
f
∗
(
x
)
, then by selecting the appropriate loss function,
f
∗
can always be expressed as the minimizer of the expected loss across all possible functions. That is,
f
∗
=
arg
min
f
∈
F
∗
I
P
(
f
)
Here we let
F
∗
be the collection of all possible functions mapping
X
onto
Y
.
f
∗
can be interpreted as the actual data generating mechanism. However, the no free lunch theorem tells us that in practice, with finite samples we cannot hope to search for the expected risk minimizer over
F
∗
. Thus we often consider a subset of
F
∗
,
F
, to carry out searches on. By doing so, we risk that
f
∗
might not be an element of
F
. This tradeoff can be mathematically expressed as
In the above decomposition, part
(
b
)
does not depend on the data and is non-stochastic. It describes how far away our assumptions (
F
) are from the truth (
F
∗
).
(
b
)
will be strictly greater than 0 if we make assumptions that are too strong (
F
too small). On the other hand, failing to put enough restrictions on
F
will cause it to be not learnable, and part
(
a
)
will not stochastically converge to 0. This is the well-known overfitting problem in statistics and machine learning literature.
A good example where learnable classes are used is the so-called Tikhonov regularization in reproducing kernel Hilbert space (RKHS). Specifically, let
F
∗
be an RKHS, and
|
|
⋅
|
|
2
be the norm on
F
∗
given by its inner product. It is shown in that
F
=
{
f
:
|
|
f
|
|
2
≤
γ
}
is a learnable class for any finite, positive
γ
. The empirical minimization algorithm to the dual form of this problem is
arg
min
f
∈
F
∗
{
∑
i
=
1
n
L
(
f
(
x
i
)
,
y
i
)
+
λ
|
|
f
|
|
2
}
This was first introduced by Tikhonov to solve ill-posed problems. Many statistical learning algorithms can be expressed in such a form (for example, the well-known ridge regression).
The tradeoff between
(
a
)
and
(
b
)
in (2) is geometrically more intuitive with Tikhonov regularization in RKHS. We can consider a sequence of
{
F
γ
}
, which are essentially balls in
F
∗
with centers at 0. As
γ
gets larger,
F
γ
gets closer to the entire space, and
(
b
)
is likely to become smaller. However we will also suffer smaller convergence rates in
(
a
)
. The way to choose an optimal
γ
in finite sample settings is usually through cross-validation.
Part
(
a
)
in (2) is closely linked to empirical process theory in statistics, where the empirical risk
{
∑
i
=
1
n
L
(
y
i
,
f
(
x
i
)
)
,
f
∈
F
}
are known as empirical processes. In this field, the function class
F
that satisfies the stochastic convergence
are known as uniform Glivenko–Cantelli classes. It has been shown that under certain regularity conditions, learnable classes and uniformly Glivenko-Cantelli classes are equivalent. Interplay between
(
a
)
and
(
b
)
in statistics literature is often known as the bias-variance tradeoff.
However, note that in the authors gave an example of stochastic convex optimization for General Setting of Learning where learnability is not equivalent with uniform convergence.
