In this setting a positive-semidefinite kernel is an inner-product similarity: there exist a real Hilbert space and a feature map such that
The feature map may be infinite-dimensional. Equivalently, is symmetric and every finite kernel matrix is a positive semidefinite matrix. The equivalence follows by forming the canonical feature space of a positive-semidefinite kernel and taking its Hilbert space completion.
For every , every choice , and every coefficient vector , the required condition is
Thus for the kernel matrix . For a feature map, this follows from
In kernel methods, the term positive-definite kernel commonly uses this non-strict inequality. Strict positive definiteness is the stronger requirement that the expression be positive for distinct inputs and every nonzero ; it is not required here.
The closure property of positive-semidefinite kernels gives three constructions, each seen directly from the feature maps .
Another useful consequence is pullback: if and is a positive-semidefinite kernel on , then has feature map .

Articles by others on the same topic (0)

There are currently no matching articles.