A DC-programming algorithm for kernel selection

ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning

Volumn 2006, Issue , 2006, Pages 41-48

  Argyriou, Andreas ^a   Hauser, Raphael ^b   Micchelli, Charles A ^c   Pontil, Massimiliano ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; GAUSSIAN NOISE (ELECTRONIC); MATHEMATICAL PROGRAMMING; NUMBER THEORY; OPTIMIZATION; PROBLEM SOLVING;

CONVEX REGULARIZATION FUNCTIONAL; DC PROGRAMMING ALGORITHM; DIFFERENCE OF CONVEX FUNCTIONS (DC); ISOTROPIC GAUSSIANS;

FUNCTION EVALUATION;

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

References (21)

1. Argyriou, A., Micchelli, C. A., & Pontil, M. (2005). Learning convex combinations of continuously parameterized basic kernels. Proc. of the 18th Conference on Learning Theory, pages 338-352.
2. Aronszajn, N. (1950). Theory of reproducing kernels. Trans. Amer. Math. Soc., 686, 337-404.
3. Bach, F. R., Lanckriet, G. R. G., & Jordan, M. I. (2004). Multiple kernel learning, conic duality, and the SMO algorithm. Proc. of the 21st International Conference on Machine Learning.
4. Chapelle, O., Vapnik, V., Bousquet, O., & Mukherjee, S. (2002). Choosing multiple parameters for support vector machines. Machine Learning, Springer, 2002.
5. Ellis, S., & Nayakkankuppam, M. (2003). Phylogenetic analysis via DC programming (preprint). Department of Mathematics and Statistics, UMBC, Baltimore, MD.
6. Hartman, P. (1959). On functions representable as a difference of convex functions. Pacific Journal of Mathematics, 9: 707-713.
7. Horst, R., & Thoai, N. V. (1999). DC programming: overview. Journal of Optimization Theory and Applications, 103, 1-41.
8. Lanckriet, G. R. G., Cristianini, N., Bartlett, P., El-Ghaoui, L., & Jordan, M. I. (2004). Learning the kernel matrix with semi-definite programming. Journal of Machine Learning Research, 5, 27-72.
9. Lin, Y., & Zhang, H. H. (2003). Component selection and smoothing in smoothing spline analysis of variance models - cosso (Technical Report 2556). Institute of Statistics Mimeo Series, NCSU.
10. Micchelli, C. A., & Pontil, M. (2005). Learning the kernel function via regularization. J. of Machine Learning Research, 6: 1099-1125, 2005.
11. Micchelli, C. A., & Pontil, M. (2005b). Feature space perspectives for learning the kernel. To appear in Machine Learning
12. (see also: Technical Report RN/05/11, Dept. of Computer Science, UCL).
13. Micchelli, C. A., Pontil, M., Wu, Q., & Zhou, D-X. (2005c). Error bounds for learning the kernel. Research Note RN/05/09, Dept of Computer Science, UCL, 2005.
14. Neumann, J., Schnörr, C., Steidl, G. (2004). SVM-based feature selction by direct objective minimisation. C.E. Rasmussen et al (eds.), Proc. of 26th DAGM Symposium.
15. Ong, C. S., Smola, A. J. & Williamson. R. C. (2003). Hyperkernels. Advances in Neural Information Processing Systems, 15, S. Becker et. al (Eds.), MIT Press, Cambridge, MA.
16. Rasmussen, C. E. & Williams, C. K. I. (2005). Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning). The MIT Press, Cambridge, MA.
17. Schoenberg, I. J. (1938). Metric spaces and completely monotone functions. Annals of Mathematics, 39, 811-841.
18. Schölkopf, B. & Smola, A. J. (2002). Learning with Kernels. The MIT Press, Cambridge, MA.
19. Shawe-Taylor, J., & Cristianini, N. (2004). Kernel Methods for Pattern Analysis. Cambridge University Press.
20. Sonnenburg, S., Raetsch, G. & Schaefer, C. (2006). A General and efficient multiple kernel learning algorithm In Advances in Neural Information Processing Systems, 19.
21. Steinig, J. (1986). A rule of signs for real exponential polynomials. Acta Math. Hungar. 47 (1), 187-190.