Sampling-based Nyström Approximation and Kernel Quadrature

01/23/2023
by   Satoshi Hayakawa, et al.
0

We analyze the Nyström approximation of a positive definite kernel associated with a probability measure. We first prove an improved error bound for the conventional Nyström approximation with i.i.d. sampling and singular-value decomposition in the continuous regime; the proof techniques are borrowed from statistical learning theory. We further introduce a refined selection of subspaces in Nyström approximation with theoretical guarantees that is applicable to non-i.i.d. landmark points. Finally, we discuss their application to convex kernel quadrature and give novel theoretical guarantees as well as numerical observations.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset