A two-stage kernel eigenfeature plus ridge estimator recovers fast labeled-sample rates in semi-supervised regression when proxy noise is controlled and unlabeled proxies are abundant, with the same guarantees for distribution regression.
An Improved Bound for the Nystrom Method for Large Eigengap
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We develop an improved bound for the approximation error of the Nystr\"{o}m method under the assumption that there is a large eigengap in the spectrum of kernel matrix. This is based on the empirical observation that the eigengap has a significant impact on the approximation error of the Nystr\"{o}m method. Our approach is based on the concentration inequality of integral operator and the theory of matrix perturbation. Our analysis shows that when there is a large eigengap, we can improve the approximation error of the Nystr\"{o}m method from $O(N/m^{1/4})$ to $O(N/m^{1/2})$ when measured in Frobenius norm, where $N$ is the size of the kernel matrix, and $m$ is the number of sampled columns.
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Semi-Supervised Learning with Noisy Proxy Covariates: Generalization Bounds and Distribution Regression
A two-stage kernel eigenfeature plus ridge estimator recovers fast labeled-sample rates in semi-supervised regression when proxy noise is controlled and unlabeled proxies are abundant, with the same guarantees for distribution regression.