English

An Improved Bound for the Nystrom Method for Large Eigengap

Machine Learning 2012-09-04 v1 Numerical Analysis Machine Learning

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/m1/4)O(N/m^{1/4}) to O(N/m1/2)O(N/m^{1/2}) when measured in Frobenius norm, where NN is the size of the kernel matrix, and mm is the number of sampled columns.

Cite

@article{arxiv.1209.0001,
  title  = {An Improved Bound for the Nystrom Method for Large Eigengap},
  author = {Mehrdad Mahdavi and Tianbao Yang and Rong Jin},
  journal= {arXiv preprint arXiv:1209.0001},
  year   = {2012}
}
R2 v1 2026-06-21T21:58:13.035Z