Matrix coherence and the Nyström method

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 572-579

  Talwalkar, Ameet ^a   Rostamizadeh, Afshin ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY;

LARGE-SCALE LEARNING; LOW RANK APPROXIMATIONS; M METHOD; MATRIX COMPLETION; RELATED WORKS; SPEED UP; THEORETICAL BOUNDS;

ARTIFICIAL INTELLIGENCE;

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

References (25)

1. A. Asuncion and D.J. Newman. UCI machine learning repository. http://www.ics.uci.edu/~mlearn/MLRepository.html, 2007.
2. M. A. Belabbas and P. J. Wolfe. Spectral methods in machine learning and new strategies for very large datasets. Proceedings of the National Academy of Sciences of the United States of America, 106(2):369-374, January 2009.
3. Emmanuel J. Candès and Benjamin Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6):717-772, 2009.
4. E. J. Candès and J. Romberg. Sparsity and incoherence in compressive sampling. Inverse Problems, 23(3):969-986, 2007.
5. Emmanuel J. Candès and Terence Tao. The power of convex relaxation: Near-optimal matrix completion. arXiv:0903.1476v1[cs.IT], 2009.
6. Emmanuel J. Candès, Justin K. Romberg, and Terence Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52(2):489-509, 2006. (Pubitemid 43174093)
7. Vin de Silva and Joshua Tenenbaum. Global versus local methods in nonlinear dimensionality reduction. In Neural Information Processing Systems, 2003.
8. David L. Donoho. Compressed Sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
9. Petros Drineas and Michael W. Mahoney. On the Nyström method for approximating a Gram matrix for improved kernel-based learning. Journal of Machine Learning Research, 6:2153-2175, 2005. (Pubitemid 41832630)
10. Rob Fergus, Yair Weiss, and Antonio Torralba. Semisupervised learning in gigantic image collections. In Neural Information Processing Systems, 2009.
11. Charless Fowlkes, Serge Belongie, Fan Chung, and Jitendra Malik. Spectral grouping using the Nyström method. Transactions on Pattern Analysis and Machine Intelligence, 26(2):214-225, 2004.
12. A. Gustafson, E. Snitkin, S. Parker, C. DeLisi, and S. Kasif. Towards the identification of essential genes using targeted genome sequencing and comparative analysis. BMC:Genomics, 7:265, 2006.
13. Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar. Ensemble Nyström method. In Neural Information Processing Systems, 2009.
14. Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar. On sampling-based approximate spectral decomposition. In International Conference on Machine Learning, 2009.
15. Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar. Sampling techniques for the Nyström method. In Conference on Artificial Intelligence and Statistics, 2009.
16. Yann LeCun and Corinna Cortes. The MNIST database of handwritten digits. http://yann.lecun.com/exdb/mnist/, 1998.
17. Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. On spectral clustering: analysis and an algorithm. In Neural Information Processing Systems, pages 849-856, 2001.
18. John C. Platt. Fast embedding of sparse similarity graphs. In Neural Information Processing Systems, 2004.
19. Mark Rudelson. Random vectors in the isotropic position. Journal of Functional Analysis, 164(1):60-72, 1999.
20. Craig Saunders, Alexander Gammerman, and Volodya Vovk. Ridge Regression learning algorithm in dual variables. In International Conference on Machine Learning, 1998.
21. Bernhard Schölkopf, Alexander Smola, and KlausRobert Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299-1319, 1998. (Pubitemid 128463674)
22. Terence Sim, Simon Baker, and Maan Bsat. The CMU pose, illumination, and expression database. In Conference on Automatic Face and Gesture Recognition, 2002.
23. Ameet Talwalkar, Sanjiv Kumar, and Henry Rowley. Large-scale manifold learning. In Conference on Vision and Pattern Recognition, 2008.
24. Christopher K. I.Williams and Matthias Seeger. Using the Nyström method to speed up kernel machines. In Neural Information Processing Systems, 2000.
25. Kai Zhang, Ivor Tsang, and James Kwok. Improved Nyström low-rank approximation and error analysis. In International Conference on Machine Learning, 2008.