paper-with-me

홈 › Papers

Sampling-based Nyström Approximation and Kernel Quadrature

2023-01-23 · Satoshi Hayakawa, Harald Oberhauser, Terry Lyons

We analyze the Nystr\"om approximation of a positive definite kernel associated with a probability measure. We first prove an improved error bound for the conventional Nystr\"om 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\"om 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.

📄 PDF Abstract BibTeX arXiv:2301.09517

Code (1)

satoshi-hayakawa/kernel-quadrature 공식 구현

Tasks

Learning Theory

Similar Papers 제목 키워드 기반

Recursive Sampling for the Nystrom Method

2017-12-01 · NeurIPS 2017 12 · Cameron Musco, Christopher Musco

We give the first algorithm for kernel Nystrom approximation that runs in linear time in the number of training points and is provably accurate for all kernel matrices, without dependence on regularity or incoherence con…

Nyström Kernel Mean Embeddings

2022-01-31 · Antoine Chatalic, Nicolas Schreuder, Alessandro Rudi, Lorenzo Rosasco

Kernel mean embeddings are a powerful tool to represent probability distributions over arbitrary spaces as single points in a Hilbert space. Yet, the cost of computing and storing such embeddings prohibits their direct u…

Recursive Sampling for the Nyström Method

2016-05-24 · Cameron Musco, Christopher Musco

We give the first algorithm for kernel Nystr\"om approximation that runs in *linear time in the number of training points* and is provably accurate for all kernel matrices, without dependence on regularity or incoherence…

Boosting Nyström Method

2023-02-21 · Keaton Hamm, Zhaoying Lu, Wenbo Ouyang, Hao Helen Zhang

The Nystr\"{o}m method is an effective tool to generate low-rank approximations of large matrices, and it is particularly useful for kernel-based learning. To improve the standard Nystr\"{o}m approximation, ensemble Nyst…

Diversity sampling is an implicit regularization for kernel methods

2020-02-20 · Michaël Fanuel, Joachim Schreurs, Johan A. K. Suykens

Kernel methods have achieved very good performance on large scale regression and classification problems, by using the Nystr\"om method and preconditioning techniques. The Nystr\"om approximation -- based on a subset of …

DiversityPoint Processesregression