Math 2.0

Functional analysis Definition

Kernel approximation in reproducing kernel Hilbert spaces

Builds on Reproducing kernel Hilbert spaceMatrix

Definition

Let XX be a set and let K ⁣:X×X→ℝK \colon X \times X \to \R be a symmetric positive definite kernel. Let HKH_K be its reproducing kernel Hilbert space, so that f(x)=⟨f,K(⋅,x)⟩HKf(x) = \ip{f}{K(\cdot, x)}_{H_K} for all f∈HKf \in H_K and x∈Xx \in X. Let x1,…,xn∈Xx_1, \dots, x_n \in X be distinct points and let y1,…,yn∈ℝy_1, \dots, y_n \in \R. The kernel matrix is the n×nn \times n matrix 𝐊=(K(xi,xj))i,j\mathbf{K} = (K(x_i, x_j))_{i,j}. If 𝐊\mathbf{K} is invertible, the kernel interpolant of the data is s=∑j=1ncjK(⋅,xj),𝐊c=y,s = \sum_{j=1}^{n} c_j K(\cdot, x_j), \qquad \mathbf{K} c = y , which satisfies s(xi)=yis(x_i) = y_i for i=1,…,ni = 1, \dots, n. For λ>0\lambda > 0, the regularized kernel approximant is sλ=∑jcjK(⋅,xj)s_\lambda = \sum_{j} c_j K(\cdot, x_j) with (𝐊+λI)c=y(\mathbf{K} + \lambda I) c = y. Kernel approximation in HKH_K is the approximation of a function ff by ss or sλs_\lambda built from the data yi=f(xi)y_i = f(x_i).

Remarks

The interpolant ss is the unique element of minimal norm in HKH_K among those gg with g(xi)=yig(x_i) = y_i for all ii. If f∈HKf \in H_K and yi=f(xi)y_i = f(x_i), then ss is the orthogonal projection of ff onto the span of K(⋅,x1),…,K(⋅,xn)K(\cdot, x_1), \dots, K(\cdot, x_n). The regularized approximant sλs_\lambda minimizes ∑i(g(xi)−yi)2+λ∥g∥HK2\sum_{i} (g(x_i) - y_i)^2 + \lambda \norm{g}_{H_K}^2 over g∈HKg \in H_K. For f∈HKf \in H_K, ∣f(x)−s(x)∣≤P(x)∥f∥HK\abs{f(x) - s(x)} \le P(x) \norm{f}_{H_K}, where the power function is P(x)2=K(x,x)−k(x)T𝐊−1k(x)P(x)^2 = K(x, x) - k(x)^{T} \mathbf{K}^{-1} k(x) with k(x)=(K(x,xj))jk(x) = (K(x, x_j))_j. Example: K(x,y)=e−(x−y)2K(x, y) = e^{-(x - y)^2} on X=ℝX = \R, points x1=0x_1 = 0, x2=1x_2 = 1, data y=(1,1)y = (1, 1). Here 𝐊=(1e−1e−11)\mathbf{K} = \begin{pmatrix} 1 & e^{-1} \\ e^{-1} & 1 \end{pmatrix} is invertible, and c1=c2=1/(1+e−1)c_1 = c_2 = 1/(1 + e^{-1}) solves 𝐊c=y\mathbf{K} c = y. Non-example: the kernel K(x,y)=xyK(x, y) = xy on ℝ\R is only positive semidefinite; for the points 11 and 22, 𝐊=(1224)\mathbf{K} = \begin{pmatrix} 1 & 2 \\ 2 & 4 \end{pmatrix} is singular, and the data y=(1,0)y = (1, 0) cannot be interpolated by any c xc\,x.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Matrix concept
  2. Reproducing kernel Hilbert space concept
  3. Kernel approximation in reproducing kernel Hilbert spaces definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Reproducing_kernel_Hilbert_space
About this page
TagCRF6HCM0Q5
URIm2://CRF6HCM0Q5
Kinddefinition
WritingW0 stub
MSC46E22, 41A05, 41A63
DefinesKernel approximation in reproducing kernel Hilbert spaces
UsesReproducing kernel Hilbert space, Matrix

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.