Gain with no Pain: Efficient Kernel-PCA by Nyström Sampling

11 July 2019

Papers citing "Gain with no Pain: Efficient Kernel-PCA by Nyström Sampling"

8 / 8 papers shown

Title
On Fast Leverage Score Sampling and Optimal Learning Alessandro Rudi Daniele Calandriello Luigi Carratino Lorenzo Rosasco 63 82 0 31 Oct 2018
Approximate Kernel PCA Using Random Features: Computational vs. Statistical Trade-off Bharath K. Sriperumbudur Nicholas Sterge 72 22 0 20 Jun 2017
Less is More: Nyström Computational Regularization Alessandro Rudi Raffaello Camoriano Lorenzo Rosasco 63 277 0 16 Jul 2015
Revisiting the Nystrom Method for Improved Large-Scale Machine Learning Alex Gittens Michael W. Mahoney 120 416 0 07 Mar 2013
Sharp analysis of low-rank kernel matrix approximations Francis R. Bach 175 282 0 09 Aug 2012
Improved Bound for the Nystrom's Method and its Application to Kernel Classification Rong Jin Tianbao Yang M. Mahdavi Yu-Feng Li Zhi Zhou 116 61 0 09 Nov 2011
Fast approximation of matrix coherence and statistical leverage P. Drineas M. Magdon-Ismail Michael W. Mahoney David P. Woodruff 168 533 0 18 Sep 2011
Hilbert space embeddings and metrics on probability measures Bharath K. Sriperumbudur Arthur Gretton Kenji Fukumizu Bernhard Schölkopf Gert R. G. Lanckriet 217 747 0 30 Jul 2009