arXiv · 1707.03220
Reducing training time by efficient localized kernel regression
Abstract
We study generalization properties of kernel regularized least squares regression based on a partitioning approach. We show that optimal rates of convergence are preserved if the number of local sets grows sufficiently slowly with the sample size. Moreover, the partitioning approach can be efficiently combined with local Nystr\"om subsampling, improving computational cost twofold.
Explore related subjects
Keep this discovery
Nicole Mücke. 2017-07-11. Reducing training time by efficient localized kernel regression. https://arxiv.org/abs/1707.03220
Cite the original work for its findings. Save a collection to share your selection of sources.