On sampling-based approximate spectral decomposition

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 553-560

  Kumar, Sanjiv ^a   Mohri, Mehryar ^a   Talwalkar, Ameet ^b  

^a GOOGLE INC   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SAMPLING; DATA SETS; DENSE MATRICES; MACHINE LEARNING APPLICATIONS; MATRIX; NOVEL TECHNIQUES; SAMPLING METHOD; SAMPLING-BASED; SPECTRAL DECOMPOSITION; SPECTRAL DECOMPOSITION TECHNIQUE; STANDARD SAMPLING METHODS;

ROBOT LEARNING;

SINGULAR VALUE DECOMPOSITION;

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

References (12)

1. Deshpande, A., Rademacher, L., Vempala, S., & Wang, G. (2006). Matrix approximation and projective clustering via volume sampling. Symposium on Discrete Algorithms (pp. 1117-1126).
2. Drineas, P., & Mahoney, M. W. (2005). On the Nyström method for approximating a Gram matrix for improved kernel-based learning. Journal of Machine Learning Research, 6, 2153-2175.
3. Fowlkes, & Belongie, S., Chung, F., & Malik, J. (2004). Spectral grouping using the Nyström method. Transactions on Pattern Analysis and Machine Intelligence, 26, 214-225.
4. Frieze, A., Kannan, R., & Vempala, S. (1998). Fast Monte-Carlo algorithms for finding low-rank approximations. Found. of Comp. Sci. (pp. 370-378).
5. Kumar, S., Mohri, M., & Talwalkar, A. (2009). Sampling techniques for the Nyström method. Conf on Artificial Intelligence and Statistics (pp. 304-311).
6. LeCun, Y., & Cortes, C. (2009). The MNIST database of handwritten digits.
7. Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001). On spectral clustering: analysis and an algorithm. Neural Info. Proc. Systems (pp. 849-856).
8. Platt, J. C. (2004). Fast embedding of sparse similarity graphs. Neural Info. Proc. Systems (pp. 571-578).
9. Sim, T., Baker, S., & Bsat, M. (2002). The CMU PIE database. Conf on Auto. Face and Gesture Recog (pp. 53-58).
10. Talwalkar, A., Kumar, S., & Rowley, H. (2008). Large-scale manifold learning. Conference on Vision and Pattern Recognition (pp. 1-8).
11. Williams, C. K. I., & Seeger, M. (2000). Using the Nyström method to speed up kernel machines. Neural Info. Proc. Systems (pp. 682-688).
12. Zhang, K., Tsang, I., & Kwok, J. (2008). Improved Nyström low-rank approximation and error analysis. Intl. Conf. on Machine Learning (pp. 273-297).