SPF-GMKL: Generalized multiple kernel learning with a million kernels

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 750-758

  Jain, Ashesh ^a   Vishwanathan, S V N ^b   Varma, Manik ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b PURDUE UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

multiple kernel learning; spectral projected gradient descent; support vector machines

Indexed keywords

DATA POINTS; DATA SETS; GENERAL-PURPOSE OPTIMIZER; GRADIENT DESCENT; GRADIENT DIRECTION; GRADIENT NOISE; MULTIPLE KERNEL LEARNING; NASCENT FIELD; OBJECTIVE FUNCTION VALUES; OPTIMIZATION ALGORITHMS; OPTIMIZERS; PARAMETERIZATIONS; PROJECTED GRADIENT; REAL-WORLD APPLICATION; SECOND ORDERS; STEP SIZE; STEP SIZE SELECTION; TRAINING DATA;

ALGORITHMS; DATA MINING;

SUPPORT VECTOR MACHINES;

EID: 84866010566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339648     Document Type: Conference Paper

References (34)

1. J. Aflalo, A. Ben-Tal, C. Bhattacharyya, J. S. Nath, and S. Raman. Variable sparsity kernel learning. JMLR, 12:565-592, 2011.
2. F. R. Bach. Exploring large feature spaces with hierarchical multiple kernel learning. In NIPS, pages 105-112, 2008.
3. F. R. Bach, G. R. G. Lanckriet, and M. I. Jordan. Multiple kernel learning, conic duality, and the SMO algorithm. In ICML, pages 6-13, 2004.
4. J. Barzilai and J. Borwein. Two-point step size gradient methods. IMA J. on Numerical Analysis, 8:141-148, 1988.
5. E. G. Birgin, J. M. Martinez, and M. Raydan. Nonmonotone spectral projected gradient methods on convex sets. SIAM J. on Optimization, 10(4):1196-1211, 2000.
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. O. Chapelle and A. Rakotomamonjy. Second order optimization of kernel parameters. In NIPS Workshop on Automatic Selection of Optimal Kernels, 2008.
8. O. Chapelle, V. Vapnik, O. Bousquet, and S. Mukherjee. Choosing multiple parameters for Support Vector Machines. Machine Learning, 46:131-159, 2002.
9. J. Chen, S. Ji, B. Ceran, Q. Li, M. Wu, and J. Ye. Learning subspace kernels for classification. In KDD, pages 106-114, 2008.
10. D. Cores, R. Escalante, M. Gonzalez-Lima, and O. Jimenez. On the use of the spectral projected gradient method for support vector machines. Computational and Applied Mathematics, 28(3):327-364, 2009.
11. C. Cortes, M. Mohri, and A. Rostamizadeh. Learning non-linear combinations of kernels. In NIPS, pages 396-404, 2009.
12. N. Cristianini, J. Shawe-Taylor, A. Elisseeff, and J. Kandola. On kernel-target alignment. In NIPS, pages 367-373, 2001.
13. J. M. Danskin. The Theorey of Max-Min and its Applications to Weapons Allocation Problems. 1967.
14. K. Gai, G. Chen, and C. Zhang. Learning kernels with radiuses of minimum enclosing balls. In NIPS, pages 649-657, 2010.
15. M. Gonen and E. Alpaydin. Localized multiple kernel learning. In ICML, pages 352-359, 2008.
16. L. Grippo, F. Lampariello, and S. Lucidi. A nonmonotone line search technique for newton's method. SIAM J. on Numerical Analysis, 23:707-716, 1986.
17. A. Jain, S. V. N. Vishwanathan, and M. Varma, 2012. The SPG-GMKL code http://research.microsoft.com/~manik/code/SPG-GMKL/download.html.
18. p-norm Multiple Kernel Learning. In NIPS, pages 997-1005, 2009.
19. G. R. G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M. I. Jordan. Learning the kernel matrix with semidefinite programming. JMLR, 5:27-72, 2004.
20. C. S. Ong, A. J. Smola, and R. C. Williamson. Learning the kernel with hyperkernels. JMLR, 6:1043-1071, 2005.
21. F. Orabona and L. Jie. Ultra-fast optimization algorithm for sparse multi kernel learning. In ICML, pages 249-256, June 2011.
22. F. Orabona, L. Jie, and B. Caputo. Online-batch strongly convex multi kernel learning. In CVPR, pages 787-794, San Francisco, California, June 2010.
23. A. Rakotomamonjy, F. Bach, Y. Grandvalet, and S. Canu. SimpleMKL. JMLR, 9:2491-2521, 2008.
24. M. Raydan. The barzilai and borwein gradient method for the large scale unconstrained minimization problem. SIAM J. on Optimization, 7(1):26-33, 1997.
25. V. Sindhwani and A. C. Lozano. Non-parametric group orthogonal matching pursuit for sparse learning with multiple kernels. In NIPS, pages 2519-2527, 2011.
26. S. Sonnenburg, G. Raetsch, C. Schaefer, and B. Schoelkopf. Large scale multiple kernel learning. JMLR, 7:1531-1565, 2006.
27. I. W. Tsang and J. T. Kwok. Efficient hyperkernel learning using second-order cone programming. IEEE Transactions on Neural Networks, 17(1):48-58, 2006.
28. M. Varma and B. R. Babu. More generality in efficient multiple kernel learning. In ICML, page 134, 2009.
29. M. Varma and D. Ray. Learning the discriminative power-invariance trade-off. In ICCV, pages 1-8, 2007.
30. A. Vedaldi, V. Gulshan, M. Varma, and A. Zisserman. Multiple kernels for object detection. In ICCV, pages 606-613, 2009.
31. S. V. N. Vishwanathan, Z. Sun, N. Theera-Ampornpunt, and M. Varma. Multiple kernel learning and the SMO algorithm. In NIPS, pages 2361-2369, 2010.
32. J. Ye, , S. Ji, and J. Chen. Multi-class discriminant kernel learning via convex programming. JMLR, 9:719-758, 2008.
33. H. Zhang and W. W. Hager. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. on Optimization, 14(4):1043-1056, 2004.
34. A. Zien and C. S. Ong. Multiclass multiple kernel learning. In ICML, pages 1191-1198, 2007.