A novel adaptive Nyström approximation
Lingyan Sheng, Antonio Ortega · 2012
We propose a novel perspective on the Nyström approximation method. Sampling the columns of the kernel matrix can be interpreted as projecting the data onto the subspace spanned by the corresponding columns. Thus, the quality of Nyström approximation can be quantified by the distance between the subspace spanned by the sampled columns and the subspace spanned by the data mapped to the eigenvectors corresponding to the top eigenvalues of the kernel matrix. Based on this interpretation, we design a novel adaptive Nyström approximation algorithm, BoostNyström. BoostNyström is efficient in terms of both time and space complexity. Experiments on benchmark data sets show that BoostNyström is more effective than the state-of-art algorithms.