Skip to content
nonconvexcard

Prove the representer theorem

ProofGraduate⏱ 1 hourClassical MLrepresenter theoremorthogonal decompositionrkhsflagship

Problem

Prove that any minimiser of J(f)=c(f(x1),…,f(xn))+Ω(∥f∥HK)J(f) = c\big(f(x_1),\dots,f(x_n)\big) + \Omega(\|f\|_{\Hcal_K}) over HK\Hcal_K, with Ω\Omega strictly increasing, lies in span⁡{K(xi,⋅)}i=1n\operatorname{span}\{K(x_i,\cdot)\}_{i=1}^n. State where each hypothesis is used and give a counterexample showing that strict monotonicity of Ω\Omega cannot be dropped to mere monotonicity if uniqueness of the representation is wanted.

Write a complete argument. Every inequality you use should be one you could state precisely.

Solution

Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.

Related problems

All problems
SolvedProblemFieldTypeDifficultyTime
Implement kernel ridge regression runClassical MLCodingIntermediate1 hour
Kernel ridge regression in closed formClassical MLProofIntermediate30 min
The Gaussian kernel is positive definiteClassical MLProofIntermediate30 min
Prove the O(1/t) rate for gradient descent abyssOptimizationProofAdvanced1 hour
The reproducing property and its consequencesClassical MLProofAdvanced30 min