Functional analysis Definition
Kernel approximation in reproducing kernel Hilbert spaces
Builds on Reproducing kernel Hilbert spaceMatrix
Definition
Let be a set and let be a symmetric positive definite kernel. Let be its reproducing kernel Hilbert space, so that for all and . Let be distinct points and let . The kernel matrix is the matrix . If is invertible, the kernel interpolant of the data is which satisfies for . For , the regularized kernel approximant is with . Kernel approximation in is the approximation of a function by or built from the data .
Remarks
The interpolant is the unique element of minimal norm in among those with for all . If and , then is the orthogonal projection of onto the span of . The regularized approximant minimizes over . For , , where the power function is with . Example: on , points , , data . Here is invertible, and solves . Non-example: the kernel on is only positive semidefinite; for the points and , is singular, and the data cannot be interpolated by any .
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
- no evidence level
- Matrix concept
- Reproducing kernel Hilbert space concept
- Kernel approximation in reproducing kernel Hilbert spaces definition
Further reading
About this page
| Tag | CRF6HCM0Q5 |
|---|---|
| URI | m2://CRF6HCM0Q5 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 46E22, 41A05, 41A63 |
| Defines | Kernel approximation in reproducing kernel Hilbert spaces |
| Uses | Reproducing 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.