Memory efficient kernel approximation

31st International Conference on Machine Learning, ICML 2014

Volumn 2, Issue , 2014, Pages 1057-1069

  Si, Si ^a   Hsieh, Cho Jui ^a   Dhillon, Inderjit S ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; MATRIX ALGEBRA; REGRESSION ANALYSIS; SCHEDULING ALGORITHMS; STATISTICAL TESTS;

APPROXIMATION ERRORS; KERNEL APPROXIMATION; KERNEL MATRICES; KERNEL RIDGE REGRESSIONS; LOW RANK APPROXIMATIONS; MEMORY EFFICIENT; SINGLE- MACHINES; STATE OF THE ART;

APPROXIMATION ALGORITHMS;

EID: 84919905043     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Bach, Francis R. and Jordan, Michael I. Predictive low- rank decomposition for kernel methods. In ICML, 2005.
2. Bache, K. and Lichman, M. UCI machine learning repository, 2013. URL http://archive.ics.uci.edu/ml.
3. Cortes, C. and Vapnik, V. Support-vector networks. Machine Learning, 20:273-297, 1995.
4. Cotter, A., Keshet, J., and Srebro, N. Explicit approximations of the Gaussian kernel. arXiv:1109.47603, 2011.
5. Cucker, F. and Smale, S. On the mathematical foundations of learning. Bulletin of the American Mathematical Society, 39:1-49, 2001.
6. Drineas, P. and Mahoney, M. W. On the Nystrom method for approximating a Gram matrix for improved kernel- based learning. Journal of Machine Learning Research, 6:2153-2175, 2005.
7. Fine, S. and Scheinberg, K. Efficient SVM training using low-rank kernel representations. Journal of Machine Learning Research, 2:243-264, 2001.
8. Gittens, A. and Mahoney, M. W. Revisiting the Nystrom method for improved large-scale machine learning. In ICML, 2013.
9. Halko, N., Martinsson, P. G., and Tropp, J. A. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2):217-288, 2011.
10. Kumar, S, Mohri, M., and Talwalkar, A. Ensemble Nystrom methods. In NIPS, 2009.
11. Kumar, S., Mohri, M., and Talwalkar, A. Sampling methods for the Nystrom method. Journal of Machine Learning Research, 13:981-1006, 2012.
12. Le, Q. V., Sarlos, T., and Smola, A. J. Fastfood - Approximating kernel expansions in loglinear time. In ICML, 2013.
13. Li, Mu, Kwok, James, T and Lu, Bao-Liang. Making large-scale Nystrom approximation possible. In ICML, 2010.
14. Rahimi, A. and Recht, B. Random features for large-scale kernel machines. In NIPS, 2007.
15. Rahimi, A. and Recht, B. Weighted sums of random kitchen sinks: replacing minimization with randomization in learning. In NIPS, 2008.
16. Saunders, C., Gammerman, A., and Vovk, V. Ridge regression learning algorithm in dual variables. In ICML, 1998.
17. Savas, B. and Dhillon, I. S. Clustered low rank approximation of graphs in information science applications. In SDM, 2011.
18. Scholkopf, B. and Smola, A. J. Learning with kernels. MIT Press, 2002.
19. Shi, J. and Malik, J. Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
20. Smola, A. J. and Scholkopf, B. Sparse greedy matrix approximation for machine learning. In ICML, 2000.
21. Stewart, G.W. and Ji-Guang, Sun. Matrix Perturbation Theory. Academic Press, Boston, 1990.
22. von Luxburg, U. A tutorial on spectral clustering. Statistics and Computing, 17(4), 2007.
23. Williams, Christopher and Seeger, M. Using the Nystrom method to speed up kernel machines. In NIPS, 2001.
24. Yang, T, Li, Y.-F., Mahdavi, M, Jin, R and Zhou, Z.-H. Nystrom method vs random Fourier features: A theoretical and empirical comparison. In NIPS, 2012.
25. Zhang, K. and Kwok, J. T. Clustered Nystrom method for large scale manifold learning and dimension reduction. IEEE Trans. Neural Networks, 21 (10): 1576-1587, 2010.
26. Zhang, K., Tsang, I. W., and Kwok, J. T. Improved Nystrom low rank approximation and error analysis. In ICML, 2008.
27. Zhang, K, Lan, L, Wang, Z., and Moerchen, F. Scaling up kernel SVM on limited resources: A low-rank linearization approach. In AISTATS, 2012.