Fast prediction for large-scale kernel machines

Advances in Neural Information Processing Systems

Volumn 4, Issue January, 2014, Pages 3689-3697

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

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); ERRORS; INFORMATION SCIENCE; REGRESSION ANALYSIS;

DIVIDE AND CONQUER; KERNEL APPROXIMATION; KERNEL RIDGE REGRESSIONS; LARGE SCALE CLASSIFICATIONS; OBJECTIVE FUNCTIONS; PREDICTION ACCURACY; PREDICTION ERRORS; STATE OF THE ART;

FORECASTING;

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

References (29)

1. Y.-W. Chang, C.-J. Hsieh, K.-W. Chang, M. Ringgaard, and C.-J. Lin. Training and testing low-degree polynomial data mappings via linear SVM. JMLR, 11: 1471-1490, 2010.
2. M. Cossalter, R. Yan, and L. Zheng. Adaptive kernel approximation for large-scale non-linear svm prediction. In ICML, 2011.
3. A. Cotter, S. Shalev-Shwartz, and N. Srebro. Learning optimally sparse support vector machines. In ICML, 2013.
4. P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition. SIAM J. Comput., 36(1): 184-206, 2006.
5. P. Drineas and M. W. Mahoney. On the Nyström method for approximating a Gram matrix for improved kernel-based learning. JMLR, 6: 2153-2175, 2005.
6. R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin. LIBLINEAR: A library for large linear classification. JMLR, 9: 1871-1874, 2008.
7. C.-J. Hsieh, I. S. Dhillon, P. Ravikumar, and A. Banerjee. A divide-and-conquer method for sparse inverse covariance estimation. In NIPS, 2012.
8. C.-J. Hsieh, S. Si, and I. S. Dhillon. A divide-and-conquer solver for kernel support vector machines. In ICML, 2014.
9. T. Joachims and C.-N. Yu. Sparse kernel svms via cutting-plane training. Machine Learning, 76(2): 179-193, 2009.
10. C. Jose, P. Goyal, P. Aggrwal, and M. Varma. Local deep kernel learning for efficient non-linear svm prediction. In ICML, 2013.
11. H. G. Jung and G. Kim. Support vector number reduction: Survey and experimental evaluations. IEEE Transactions on Intelligent Transportation Systems, 2014.
12. P. Kar and H. Karnick. Random feature maps for dot product kernels. In AISTATS, 2012.
13. S. S. Keerthi, O. Chapelle, and D. DeCoste. Building support vector machines with reduced classifier complexity. JMLR, 7: 1493-1515, 2006.
14. S. Kumar, M. Mohri, and A. Talwalkar. Ensemble Nyström methods. In NIPS, 2009.
15. L. Ladicky and P. H. S. Torr. Locally linear support vector machines. In ICML, 2011.
16. Q. V. Le, T. Sarlos, and A. J. Smola. Fastfood - approximating kernel expansions in loglinear time. In ICML, 2013.
17. Y.-J. Lee and O. L. Mangasarian. RSVM: Reduced support vector machines. In SDM, 2001.
18. S. Maji, A. C. Berg, and J. Malik. Efficient classification for additive kernel svms. IEEE PAMI, 35(1), 2013.
19. M. Nandan, P. R. Khargonekar, and S. S. Talathi. Fast svm training using approximate extreme points. JMLR, 15: 59-98, 2014.
20. D. Pavlov, D. Chudova, and P. Smyth. Towards scalable support vector machines using squashing. In KDD, pages 295-299, 2000.
21. A. Rahimi and B. Recht. Random features for large-scale kernel machines. In NIPS, pages 1177-1184, 2007.
22. B. Schölkopf, P. Knirsch, A. J. Smola, and C. J. C. Burges. Fast approximation of support vector kernel expansions, and an interpretation of clustering as approximation in feature spaces. In Mustererkennung 1998-20. DAGM-Symposium, Informatik aktuell, pages 124-132, Berlin, 1998. Springer.
23. S. Si, C.-J. Hsieh, and I. S. Dhillon. Memory efficient kernel approximation. In ICML, 2014.
24. I. Tsang, J. Kwok, and P. Cheung. Core vector machines: Fast SVM training on very large data sets. JMLR, 6: 363-392, 2005.
25. P.-W. Wang and C.-J. Lin. Iteration complexity of feasible descent methods for convex optimization. JMLR, 15: 1523-1548, 2014.
26. S. Wang and Z. Zhang. Improving cur matrix decomposition and the nyström approximation via adaptive sampling. JMLR, 14: 2729-2769, 2013.
27. C. K. I. Williams and M. Seeger. Using the Nyström method to speed up kernel machines. In T. Leen, T. Dietterich, and V. Tresp, editors, NIPS, 2001.
28. K. Zhang and J. T. Kwok. Clustered Nyström method for large scale manifold learning and dimension reduction. Trans. Neur. Netw., 21(10): 1576-1587, 2010.
29. K. Zhang, I. W. Tsang, and J. T. Kwok. Improved Nyström low rank approximation and error analysis. In ICML, 2008.