On the impact of kernel approximation on learning accuracy

Journal of Machine Learning Research

Volumn 9, Issue , 2010, Pages 113-120

  Cortes, Corinna ^a   Mohri, Mehryar ^a   Talwalkar, Ameet ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE OF APPROXIMATION; KERNEL APPROXIMATION; KERNEL MATRICES; LEARNING ACCURACY; LOW RANK APPROXIMATIONS; REGULARIZATION ALGORITHMS; RIDGE REGRESSION;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; REGRESSION ANALYSIS;

QUALITY CONTROL;

EID: 84862278427     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (22)

1. A. Asuncion and D.J. Newman. UCI machine learning repository, 2007.
2. Francis Bach and Michael Jordan. Kernel independent component analysis. Journal of Machine Learning Research, 3:1-48, 2002.
3. Francis R. Bach and Michael I. Jordan. Predictive lowrank decomposition for kernel methods. In International Conference on Machine Learning, 2005.
4. 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.
5. Mikhail Belkin, Irina Matveeva, and Partha Niyogi. Regularization and semi-supervised learning on large graphs. In Conference on Learning Theory, 2004.
6. Olivier Bousquet and André Elisseeff. Algorithmic stability and generalization performance. In Advances in Neural Information Processing Systems, 2001.
7. Corinna Cortes and Vladimir Vapnik. Support-Vector Networks. Machine Learning, 20(3):273-297, 1995.
8. 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.
9. Shai Fine and Katya Scheinberg. Efficient SVM training using low-rank kernel representations. Journal of Machine Learning Research, 2:243-264, 2002.
10. Zoubin Ghahramani. The kin datasets, 1996.
11. Ling Huang, Donghui Yan, Michael Jordan, and Nina Taft. Spectral clustering with perturbed data. In Advances in Neural Information Processing Systems, 2008.
12. Zakria Hussain and John Shawe-Taylor. Theory of matching pursuit. In Advances in Neural Information Processing Systems, 2008.
13. Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar. Ensemble Nyström method. In Advances 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,MehryarMohri, and Ameet Talwalkar. Sampling techniques for the Nyström method. In Conference on Artificial Intelligence and Statistics, 2009.
16. Craig Saunders, Alexander Gammerman, and Volodya Vovk. Ridge regression learning algorithm in dual variables. In International Conference on Machine Learning, 1998.
17. Bernhard Schölkopf and Alex Smola. Learning with Kernels. MIT Press: Cambridge, MA, 2002.
18. Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299-1319, 1998.
19. Ameet Talwalkar, Sanjiv Kumar, and Henry Rowley. Large-scale manifold learning. In Conference on Vision and Pattern Recognition, 2008.
20. Pascal Vincent and Yoshua Bengio. Kernel Matching Pursuit. Technical Report 1179, Département d'Informatique et Recherche Opé rationnelle, Université de Montréal, 2000.
21. Christopher K. I. Williams and Matthias Seeger. Using the Nyström method to speed up kernel machines. In Advances in Neural Information Processing Systems, 2000.
22. Kai Zhang, Ivor Tsang, and James Kwok. Improved Nyström low-rank approximation and error analysis. In International Conference on Machine Learning, 2008.