Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Kundu, Achintya ^a   Tankasali, Vikram ^a   Bhattacharyya, Chiranjib ^a   Ben Tal, Aharon ^b,c  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS;

CARTESIAN PRODUCTS; EIGEN DECOMPOSITION; ITERATIVE ALGORITHM; KERNEL MATRICES; LEARNING KERNELS; LOSS FUNCTIONS; MULTIPLE KERNEL LEARNING; N-MATRIX; PSD MATRIXES; SIMILARITY MATRIX;

ITERATIVE METHODS;

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

References (16)

1. Stephen F. Altschul, Thomas L. Madden, Alejandro A. Schffer, Ro A. Schffer, Jinghui Zhang, Zheng Zhang,Webb Miller, and David J. Lipman. Gapped blast and psiblast: a new generation of protein database search programs. NUCLEIC ACIDS RES, 25:3389-3402, 1997.
2. A. Beck and M. Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31:167-175, 2003.
3. A. Ben-Tal, T. Margalit, and A. Nemirovski. The ordered subsets mirror descent optimization method with applications to tomography. SIAM J. Optim., 12:79-108, 2001.
4. Chih-Chung Chang and Chih-Jen Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
5. J. Chen and J. Ye. Training svm with indefinite kernels. In International Conference on Machine Learning. 2008.
6. Y. Chen, M. R. Gupta, and B. Recht. Learning kernels from indefinite similarities. In International Conference on Machine Learning. 2009.
7. G. R. Gert Lanckriet, N. Cristianini, P. Bartlett, L. E. Ghaoui, and Michael I. Jordan. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5:27-72, 2004.
8. R. Luss and A. d'Aspremont. Support vector machine classification with indefinite kernels. In Advances in Neural Information processing Systems. 2007.
9. A. G. Murzin, S. E. Brenner, T. Hubbard, and C. Chothia. Scop: a structural classification of proteins database for the investigation of sequences and structures. Journal of Molecular Biology, 247:536-540, 1995.
10. J. Saketha Nath, G. Dinesh, S. Raman, C. Bhattacharyya, A. Ben-Tal, and K.R. Ramakrishnan. On the algorithmics and applications of a mixed-norm based kernel learning formulation. In Advances in Neural Information Processing Systems, pages 844-852. 2009.
11. Saul B. Needleman and Christian D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3):443-453, 1970.
12. A. Rakotomamonjy, Francis R. Bach, S. Canu, and Y. Grandvalet. Simplemkl. Journal of Machine Learning Research, 9:2491-2521, 2008.
13. Bernhard Schölkopf and Alexander J. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond (Adaptive Computation andMachine Learning). The MIT Press, 2001.
14. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195-197, 1981.
15. G. Wu, Z. Zhang, and E. Y. Chang. An analysis of transformation on non-positive semidefinite similarity matrix for kernel machines. Technical Report, University of California, Santa Barbara, 2005.
16. Y. Ying, C. Campbell, andM. Girolami. Analysis of SVMwith indefinite kernels. In Advances in Neural Information processing Systems, 2009.