Efficient hyperkernel learning using second-order cone programming

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3201, Issue , 2004, Pages 453-464

  Tsang, Ivor W ^a   Kwok, James T ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; ERROR ANALYSIS; MATRIX ALGEBRA; PERFORMANCE; PROBABILITY; ARTIFICIAL INTELLIGENCE; OPTIMIZATION; QUADRATIC PROGRAMMING; VIRTUAL REALITY;

HYPERKERNEL LEARNING; KERNEL MATRIX LEARNING METHOD; SECOND-ORDER CONE PROGRAM (SOCP); SEMIDEFINITE PROGRAM (SDP); GENERALIZATION PERFORMANCE; INTERIOR-POINT METHOD; OPTIMIZATION PROBLEMS; QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING (QCQP); SECOND-ORDER CONE PROGRAM; SECOND-ORDER CONE PROGRAMMING; SEMI-DEFINITE PROGRAM (SDP);

LEARNING SYSTEMS;

EID: 22944446801     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30115-8_42     Document Type: Conference Paper

References (16)

1. F. Alizadeh and D. Goldfarb. Second-order cone programming. Mathematical Programming, Series B, 95:3-51, 2003.
2. F.R. Bach, G.R.G. Lanckriet, and M.I. Jordan. Multiple kernel learning, conic duality, and the SMO algorithm. In Proceedings of the Twentieth-First International Conference on Machine, Banff, Alberta, Canada, July 2004.
3. O. Bousquet and D.J.L. Herrmann. On the complexity of learning the kernel matrix. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, Cambridge, MA, 2003. MIT Press.
4. K. Crammer, J. Keshet, and Y. Singer. Kernel design using boosting. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, Cambridge, MA, 2003. MIT Press.
5. N. Cristianini, J. Shawe-Taylor, A. Elisseeff, and J. Kandola. On kernel-target alignment. In T.G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
6. S. Fine and K. Scheinberg. Efficient SVM training using low-rank kernel representation. Journal of Machine Learning Research, 2:243-264, December 2001.
7. G.R.G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M.I. Jordan. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5:27-72, 2004.
8. M.S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret. Applications of second-order cone programming. Linear Algebra Applications, 284:193-228, 1998.
9. H.D. Mittelmann. An independent benchmarking of SDP and SOCP solvers. Mathematical Programming Series B, 95:407-430, 2003.
10. Y. Nesterov and A. Nemirovskii. Interior-point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
11. C.S. Ong and A.J. Smola. Machine learning with hyperkernels. In Proceedings of the Twentieth International Conference on Machine Learning, pages 568-575, Washington DC, USA, 2003.
12. C.S. Ong, A.J. Smola, and R.C. Williamson. Hyperkernels. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, Cambridge, MA, 2003. MIT Press.
13. C.S. Ong, A.J. Smola, and R.C. Williamson. Learning the kernel with hyperkernels, 2003. Submitted to Journal of Machine Learning Research.
14. B. Schölkopf and A.J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
15. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
16. Z. Zhang, D.-Y. Yeung, and J.T. Kwok. Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm. In Proceedings of the Twentieth-First International Conference on Machine Learning, Banff, Alberta, Canada, July 2004.