A novel greedy algorithm for Nyström approximation

[edit]

Ahmed Farahat, Ali Ghodsi, Mohamed Kamel ;
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, PMLR 15:269-277, 2011.

Abstract

The Nyström method is an efficient technique for obtaining a low-rank approximation of a large kernel matrix based on a subset of its columns. The quality of the Nyström approximation highly depends on the subset of columns used, which are usually selected using random sampling. This paper presents a novel recursive algorithm for calculating the Nyström approximation, and an effective greedy criterion for column selection. Further, a very efficient variant is proposed for greedy sampling, which works on random partitions of data instances. Experiments on benchmark data sets show that the proposed greedy algorithms achieve significant improvements in approximating kernel matrices, with minimum overhead in run time. [pdf][supplementary]

Related Material