Fetching the paper…
Reading the bibliography…
In this paper, we propose and study a Nystr\"om based approach to efficient large scale kernel principal component analysis (PCA).
Some results on Tchebycheffian spline functions
Kimeldorf, G. S. and Wahba, G. (1971) · 1971
Earlier work this paper cites.
Methods of Modern Mathematical Physics: Functional Analysis I
Reed, M. and Simon, B. (1980) · 1980
Earlier work this paper cites.
Principal Component Analysis
Jolliffe, I. (1986) · 1986
Earlier work this paper cites.
The Hoffman-Wielandt inequality in infinite dimensions
R. Bhatia, L. E. (1994) · 1994
Earlier work this paper cites.
Nonlinear component analysis as a kernel eigenvalue problem
Schölkopf, B., Smola, A., and Müller, K.-R. (1998) · 1998
Earlier work this paper cites.
A generalized representer theorem
Schölkopf, B., Herbrich, R., and Smola, A. (2001) · 2001
Earlier work this paper cites.
Using the Nyström method to speed up kernel machines
Williams, C. and Seeger, M. (2001) · 2001
Earlier work this paper cites.
Basic Classes of Linear Operators
Gohberg, I., Goldberg, S., and Kaashoek, R. (2003) · 2003
Earlier work this paper cites.
On the Nyström method for approximating a Gram matrix for improved kernel-based learning
Drineas, P. and Mahoney, M. W. (2005) · 2005
Earlier work this paper cites.
On the eigenspectrum of the Gram matrix and the generalisation error of kernel PCA
Shawe-Taylor, J., Williams, C., Christianini, N., and Kandola, J. (2005) · 2005
Earlier work this paper cites.
Statistical properties of kernel principal component analysis
Blanchard, G., Bousquet, O., and Zwald, L. (2007) · 2007
Earlier work this paper cites.
Learning theory estimates via integral operators and their approximations
Smale, S. and Zhou, D.-X. (2007) · 2007
Cited alongside, same era.
The tradeoffs of large scale learning
Bottou, L. and Bousquet, O. (2008) · 2008
Cited alongside, same era.
A kernel statistical test of independence
Gretton, A., Fukumizu, K., Teo, C.-H., Song, L., Schölkopf, B., and Smola, A. (2008) · 2008
Cited alongside, same era.
The projectron: a bounded kernel-based perceptron
Orabona, F., Keshet, J., and Caputo, B. (2008) · 2008
Cited alongside, same era.
Random features for large-scale kernel machines
Rahimi, A. and Recht, B. (2008) · 2008
Cited alongside, same era.
Hilbert space embeddings and metrics on probability measures
Sriperumbudur, B. K., Gretton, A., Fukumizu, K., Schölkopf, B., and Lanckriet, G. R. G. (2010) · 2010
Cited alongside, same era.
Fast Randomized Kernel Methods With Statistical Guarantees
Alaoui, A. and Mahoney, M. W. (2014) · 2014
Later among the works it cites.
Fast randomized kernel ridge regression with statistical guarantees
Alaoui, A. and Mahoney, M. (2015) · 2015
Later among the works it cites.
Uniform sampling for matrix approximation
Cohen, M. B., lee, Y. T., Musco, C., Musco, C., Peng, R., and Sidford, A. (2015) · 2015
Later among the works it cites.
Less is more: Nyström computational regularization
Rudi, A., Camoriano, R., and Rosasco, L. (2015) · 2015
Later among the works it cites.
Recursive sampling for the nyström method
Musco, C. and Musco, C. (2017) · 2017
Later among the works it cites.
Generalization properties of learning with random features
Rudi, A. and Rosasco, L. (2017) · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast approximation of matrix coherence and statistical leverage
Drineas, P., Magdon-Ismail, M., Mahoney, M. W., and Woodruff, D. P. (2012) · 2012
Cited alongside, same era.
Sharp analysis of low-rank kernel matrix approximations
Bach, F. (2013) · 2013
Cited alongside, same era.
Revisiting the Nyström method for improved large-scale machine learning
Gittens, A. and Mahoney, M. (2013) · 2013
Cited alongside, same era.
Improved bounds for the Nyström method with application to kernel classification
Jin, R., Yang, T., Mahdavi, M., Li, Y.-F., and Zhou, Z.-H. (2013) · 2013
Cited alongside, same era.
Calandriello, D., Lazaric, A., and Valko, M. (2018) · 2018
Later among the works it cites.
Approximate kernel PCA using random features: Computational vs. statistical trade-off
Sriperumbudur, B. K. and Sterge, N. (2018) · 2018
Later among the works it cites.
Streaming kernel PCA with O ~ ( n ) \tilde{O}(\sqrt{n}) random features
Ullah, M. E., Mianjy, P., Marinov, T. V., and Arora, R. (2018) · 2018
Later among the works it cites.
On the sample complexity of subspace learning
Rudi, A., Canas, G. D., and Rosasco, L. (2013) · 2075
Closest in time.