mlsanityData to 7 Oct 2026

Analysis of regularized Nystr"om subsampling for regression functions of low smoothness

arXiv 1806.00826 ↗First posted 3 Jun 2018stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

This paper studies a Nystr"om type subsampling approach to large kernel learning methods in the misspecified case, where the target function is not assumed to belong to the reproducing kernel Hilbert space generated by the underlying kernel. This case is less understood, in spite of its practical importance. To model such a case, the smoothness of target functions is described in terms of general source conditions. It is surprising that almost for the whole range of the source conditions, describing the misspecified case, the corresponding learning rate bounds can be achieved with just one value of the regularization parameter. This observation allows a formulation of mild conditions under which the plain Nystr"om subsampling can be realized with subquadratic cost maintaining the guaranteed learning rates.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Jun 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 4; 2024: 1; 2025: 0; 2026: 1.

7 papers.