A. El, A. , and M. W. Mahoney, Fast randomized kernel methods with statistical guarantees, Neural Information Processing Systems, 2015.

F. Bach, Sharp analysis of low-rank kernel matrix approximations, Conference on Learning Theory, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00723365

D. Calandriello, A. Lazaric, and M. Valko, Analysis of Nyström method with sequential ridge leverage scores, In Uncertainty in Artificial Intelligence, 2016.

M. B. Cohen, C. Musco, and C. Musco, Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017.
DOI : 10.1137/1.9781611974782.115
URL : http://arxiv.org/abs/1511.07263

A. Gittens, W. Michael, and . Mahoney, Revisiting the Nyström method for improved large-scale machine learning, International Conference on Machine Learning, 2013.

S. Kumar, M. Mohri, and A. Talwalkar, Sampling methods for the Nyström method, Journal of Machine Learning Research, vol.13, pp.981-1006, 2012.

H. Levy, Stochastic dominance: Investment decision making under uncertainty, 2015.

C. Musco and C. Musco, Provably useful kernel matrix approximation in linear time

J. Pachocki, Analysis of resparsification, 2016.

R. Patel, T. A. Goldstein, E. L. Dyer, A. Mirhoseini, and R. G. Baraniuk, oA- SIS: Adaptive column sampling for kernel matrix approximation, 2015.

A. Rudi, R. Camoriano, and L. Rosasco, Less is more: Nyström computational regularization, Neural Information Processing Systems, 2015.

B. Schölkopf, A. J. Smola, and K. Müller, Kernel principal component analysis, Advances in kernel methods, pp.327-352, 1999.
DOI : 10.1007/BFb0020217

P. David and . Woodruff, Sketching as a tool for numerical linear algebra, Foundations and Trends in Theoretical Computer Science, vol.10, issue.12, pp.1-157, 2014.