Random features for large-scale kernel machines

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Rahimi, Ali ^a   Recht, Benjamin ^b  

^a INTEL RESEARCH   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

CONVERGENCE BOUNDS; FEATURE SPACE; INNER PRODUCT; INPUT DATAS; KERNEL MACHINE; LARGE-SCALES; LINEAR METHODS; LOW DIMENSIONAL; RANDOM FEATURES; SHIFT INVARIANT;

LEARNING ALGORITHMS;

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

References (17)

1. T. Joachims. Training linear SVMs in linear time. In ACM Conference on Knowledge Discovery and Data Mining (KDD), 2006.
2. M. C. Ferris and T. S. Munson. Interior-point methods for massive Support Vector Machines. SIAM Journal of Optimization, 13(3):783-804, 2003. (Pubitemid 36971112)
3. S. Shalev-Shwartz, Y. Singer, and N. Srebro. Pegasos: Primal Estimated sub-GrAdient SOlver for SVM. In IEEE International Conference on Machine Learning (ICML), 2007.
4. D. DeCoste and D. Mazzoni. Fast query-optimized kernel machine classification via incremental approximate nearest support vectors. In IEEE International Conference on Machine Learning (ICML), 2003.
5. J. Platt. Using sparseness and analytic QP to speed training of Support Vector Machines. In Advances in Neural Information Processing Systems (NIPS), 1999.
6. C.-C. Chang and C.-J. Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
7. D. Achlioptas, F. McSherry, and B. Schölkopf. Sampling techniques for kernel methods. In Advances in Neural Information Processing Systems (NIPS), 2001.
8. A. Blum. Random projection, margins, kernels, and feature-selection. LNCS, 3940:52-68, 2006. (Pubitemid 44029879)
9. A. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low-rank approximations. In Foundations of Computer Science (FOCS), pages 378-390, 1998.
10. P. Drineas and M. W. Mahoney. On the nystrom method for approximating a Gram matrix for improved kernel-based learning. In COLT, pages 323-337, 2005.
11. C. Yang, R. Duraiswami, and L. Davis. Efficient kernel machines using the improved fast gauss transform. In Advances in Neural Information Processing Systems (NIPS), 2004.
12. Y. Shen, A. Y. Ng, and M. Seeger. Fast gaussian process regression using KD-Trees. In Advances in Neural Information Processing Systems (NIPS), 2005.
13. P. Indyk and N. Thaper. Fast image retrieval via embeddings. In International Workshop on Statistical and Computational Theories of Vision, 2003.
14. I.W. Tsang, J. T. Kwok, and P.-M. Cheung. Core Vector Machines: Fast SVM training on very large data sets. Journal of Machine Learning Research (JMLR), 6:363-392, 2005.
15. W. Rudin. Fourier Analysis on Groups. Wiley Classics Library. Wiley-Interscience, New York, reprint edition edition, 1994.
16. G. Loosli and S. Canu. Comments on the 'Core Vector Machines: Fast SVM training on very large data sets'. Journal of Machine Learning Research (JMLR), 8:291-301, February 2007. (Pubitemid 46280176)
17. F. Cucker and S. Smale. On the mathematical foundations of learning. Bull. Amer. Soc., 39:1-49, 2001.