In statistical learning theory, a representer theorem is any of several related results stating that a minimizer
f
∗
of a regularized empirical risk function defined over a reproducing kernel Hilbert space can be represented as a finite linear combination of kernel products evaluated on the input points in the training set data.
The following Representer Theorem and its proof are due to Schölkopf, Herbrich, and Smola:
Theorem: Let
X
be a nonempty set and
k
a positive-definite real-valued kernel on
X
×
X
with corresponding reproducing kernel Hilbert space
H
k
. Given a training sample
(
x
1
,
y
1
)
,
…
,
(
x
n
,
y
n
)
∈
X
×
R
, a strictly monotonically increasing real-valued function
g
:
[
0
,
∞
)
→
R
, and an arbitrary empirical risk function
E
:
(
X
×
R
2
)
n
→
R
∪
{
∞
}
, then for any
f
∗
∈
H
k
satisfying
f
∗
=
argmin
f
∈
H
k
{
E
(
(
x
1
,
y
1
,
f
(
x
1
)
)
,
.
.
.
,
(
x
n
,
y
n
,
f
(
x
n
)
)
)
+
g
(
∥
f
∥
)
}
,
(
∗
)
f
∗
admits a representation of the form:
f
∗
(
⋅
)
=
∑
i
=
1
n
α
i
k
(
⋅
,
x
i
)
,
where
α
i
∈
R
for all
1
≤
i
≤
n
.
Proof: Define a mapping
φ
:
X
→
R
X
φ
(
x
)
=
k
(
⋅
,
x
)
(so that
φ
(
x
)
=
k
(
⋅
,
x
)
is itself a map
X
→
R
). Since
k
is a reproducing kernel, then
φ
(
x
)
(
x
′
)
=
k
(
x
′
,
x
)
=
⟨
φ
(
x
′
)
,
φ
(
x
)
⟩
,
where
⟨
⋅
,
⋅
⟩
is the inner product on
H
k
.
Given any
x
1
,
.
.
.
,
x
n
, one can use orthogonal projection to decompose any
f
∈
H
k
into a sum of two functions, one lying in
span
{
φ
(
x
1
)
,
.
.
.
,
φ
(
x
n
)
}
, and the other lying in the orthogonal complement:
f
=
∑
i
=
1
n
α
i
φ
(
x
i
)
+
v
,
where
⟨
v
,
φ
(
x
i
)
⟩
=
0
for all
i
.
The above orthogonal decomposition and the reproducing property together show that applying
f
to any training point
x
j
produces
f
(
x
j
)
=
⟨
∑
i
=
1
n
α
i
φ
(
x
i
)
+
v
,
φ
(
x
j
)
⟩
=
∑
i
=
1
n
α
i
⟨
φ
(
x
i
)
,
φ
(
x
j
)
⟩
,
which we observe is independent of
v
. Consequently, the value of the empirical risk
E
in (*) is likewise independent of
v
. For the second term (the regularization term), since
v
is orthogonal to
∑
i
=
1
n
α
i
φ
(
x
i
)
and
g
is strictly monotonic, we have
g
(
∥
f
∥
)
=
g
(
∥
∑
i
=
1
n
α
i
φ
(
x
i
)
+
v
∥
)
=
g
(
∥
∑
i
=
1
n
α
i
φ
(
x
i
)
∥
2
+
∥
v
∥
2
)
≥
g
(
∥
∑
i
=
1
n
α
i
φ
(
x
i
)
∥
)
.
Therefore setting
v
=
0
does not affect the first term of (*), while it strictly decreasing the second term. Consequently, any minimizer
f
∗
in (*) must have
v
=
0
, i.e., it must be of the form
f
∗
(
⋅
)
=
∑
i
=
1
n
α
i
φ
(
x
i
)
=
∑
i
=
1
n
α
i
k
(
⋅
,
x
i
)
,
which is the desired result.
The Theorem stated above is a particular example of a family of results that are collectively referred to as "representer theorems"; here we describe several such.
The first statement of a representer theorem was due to Kimeldorf and Wahba for the special case in which
E
(
(
x
1
,
y
1
,
f
(
x
1
)
)
,
.
.
.
,
(
x
n
,
y
n
,
f
(
x
n
)
)
)
=
1
n
∑
i
=
1
n
(
f
(
x
i
)
−
y
i
)
2
,
g
(
∥
f
∥
)
=
λ
∥
f
∥
2
for
λ
>
0
. Schölkopf, Herbrich, and Smola generalized this result by relaxing the assumption of the squared-loss cost and allowing the regularizer to be any strictly monotonically increasing function
g
(
⋅
)
of the Hilbert space norm.
It is possible to generalize further by augmenting the regularized empirical risk function through the addition of unpenalized offset terms. For example, Schölkopf, Herbrich, and Smola also consider the minimization
f
~
∗
=
argmin
{
E
(
(
x
1
,
y
1
,
f
~
(
x
1
)
)
,
.
.
.
,
(
x
n
,
y
n
,
f
~
(
x
n
)
)
)
+
g
(
∥
f
∥
)
∣
f
~
=
f
+
h
∈
H
k
⊕
span
{
ψ
p
∣
1
≤
p
≤
M
}
}
,
(
†
)
i.e., we consider functions of the form
f
~
=
f
+
h
, where
f
∈
H
k
and
h
is an unpenalized function lying in the span of a finite set of real-valued functions
{
ψ
p
:
X
→
R
∣
1
≤
p
≤
M
}
. Under the assumption that the
m
×
M
matrix
(
ψ
p
(
x
i
)
)
i
p
has rank
M
, they show that the minimizer
f
~
∗
in
(
†
)
admits a representation of the form
f
~
∗
(
⋅
)
=
∑
i
=
1
n
α
i
k
(
⋅
,
x
i
)
+
∑
p
=
1
M
β
p
ψ
p
(
⋅
)
where
α
i
,
β
p
∈
R
and the
β
p
are all uniquely determined.
The conditions under which a representer theorem exists were investigated by Argyriou, Miccheli, and Pontil, who proved the following:
Theorem: Let
X
be a nonempty set,
k
a positive-definite real-valued kernel on
X
×
X
with corresponding reproducing kernel Hilbert space
H
k
, and let
R
:
H
k
→
R
be a differentiable regularization function. Then given a training sample
(
x
1
,
y
1
)
,
.
.
.
,
(
x
n
,
y
n
)
∈
X
×
R
and an arbitrary empirical risk function
E
:
(
X
×
R
2
)
m
→
R
∪
{
∞
}
, a minimizer
f
∗
=
argmin
f
∈
H
k
{
E
(
(
x
1
,
y
1
,
f
(
x
1
)
)
,
.
.
.
,
(
x
n
,
y
n
,
f
(
x
n
)
)
)
+
R
(
f
)
}
(
‡
)
of the regularized empirical risk minimization problem admits a representation of the form
f
∗
(
⋅
)
=
∑
i
=
1
n
α
i
k
(
⋅
,
x
i
)
,
where
α
i
∈
R
for all
1
≤
i
≤
n
, if and only if there exists a nondecreasing function
h
:
[
0
,
∞
)
→
R
for which
R
(
f
)
=
h
(
∥
f
∥
)
.
Effectively, this result provides a necessary and sufficient condition on a differentiable regularizer
R
(
⋅
)
under which the corresponding regularized empirical risk minimization
(
‡
)
will have a representer theorem. In particular, this shows that a broad class of regularized risk minimizations (much broader than those originally considered by Kimeldorf and Wahba) have representer theorems.
Representer theorems are useful from a practical standpoint because they dramatically simplify the regularized empirical risk minimization problem
(
‡
)
. In most interesting applications, the search domain
H
k
for the minimization will be an infinite-dimensional subspace of
L
2
(
X
)
, and therefore the search (as written) does not admit implementation on finite-memory and finite-precision computers. In contrast, the representation of
f
∗
(
⋅
)
afforded by a representer theorem reduces the original (infinite-dimensional) minimization problem to a search for the optimal
n
-dimensional vector of coefficients
α
=
(
α
1
,
.
.
.
,
α
n
)
∈
R
n
;
α
can then be obtained by applying any standard function minimization algorithm. Consequently, representer theorems provide the theoretical basis for the reduction of the general machine learning problem to algorithms that can actually be implemented on computers in practice.
