Infinitesimal annealing for training semi-supervised support vector machines

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 1934-1942

  Ogawa, Kohei ^a   Imamura, Motoki ^a   Takeuchi, Ichiro ^a   Sugiyama, Masashi ^b  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; LEARNING ALGORITHMS; SUPPORT VECTOR MACHINES;

ANNEALING ALGORITHM; CLASSIFICATION ALGORITHM; COMPUTATION COSTS; COMPUTATION TIME; GLOBAL OPTIMAL SOLUTIONS; LABELED AND UNLABELED DATA; NONCONVEX OPTIMIZATION; TRAINING ALGORITHMS;

ANNEALING;

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

References (26)

1. Allgower, E. L. and George, K. Continuation and path following. Acta Numerica, 2:1-63, 1993.
2. Best, M. J. An algorithm for the solution of the parametric quadratic programming problem. Applied Mathemetics and Parallel Computing, pp. 57-76, 1996.
3. Boser, B. E., Guyon, I. M., and Vapnik, V. N. A training algorithm for optimal margin classifiers. Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pp. 144-152, 1992.
4. Boyd, S. and Vandenberghe, L. Convex Optimization. Cambridge University Press, 2004.
5. Chapelle, O. Training a support vector machine in the primal. Neural Computation, 19(5):1155-1178, 2007.
6. Chapelle, O. and Zien, A. Semi-supervised classification by low density separation. Tenth International Workshop on Artificial Intelligence and Statistics, 2005.
7. Chapelle, O., Schölkopf, B., and Zien, A. (eds.). Semi-Supervised Learning. MIT Press, Cambridge, MA 2006.
8. Chapelle, O., Sindhwani, V., and Keerthi, S. Branch and bound for semi-supervised support vector machines. Advances in Neural Information Processing Sysrtems, 2007.
9. Chapelle, O., Sindhwani, V., and Keerthi, S. S. Optimization techniques for semi-supervised support vector machines. J. Mach. Learning Res., 9:202-233, Feb. 2008.
10. Collobert, R., Sinz, F., Weston, J., and Bottou, L. Large scale transductive SVMs. Journal of Machine Learning Research, 7:1687-1712, 2006. (Pubitemid 44223088)
11. Colorni, A., Dorigo, M., and Maniezzo, V. Distributed optimization by ant colonies. Proc. European Conference on Artificial Life, pp. 134-142, 1991.
12. Cortes, C. and Vapnik, V. Support-vector networks. Machine Learning, 20:273-297, 1995.
13. Efron, B. and Tibshirani, R. Least angle regression. Annals of Statistics, 32(2):407-499, 2004. (Pubitemid 41250302)
14. Gal, T. Postoptimal Analysis, Parametric Programming, and Related Topics. Walter de Gruyter, 1995.
15. Hastie, T., Rosset, S., Tibshirani, R., and Zhu, J. The entire regularization path for the support vector machine. Journal of Machine Learning Research, 5:-1391-415, 2004.
16. Hromkovic, J. Algorithmics for Hard Problems. Springer, 2001.
17. Joachims, T. Transductive inference for text classification using support vector machines. International Conference on Machine Learning, 1999.
18. Karasuyama, M., Harada, N., Sugiyama, M., and Takeuchi, I. Multi-parametric solution-path algorithm for instance-weighted support vector machines. Machine Learning, 88(3):297-330, 2012.
19. Kirkpatrick, S. and Gelatt, C. D. Optimization by simulated annealing. Science, 220:671-680, 1983.
20. Korte, B. and Vygen, J. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag, Berlin, 2000.
21. Ritter, K. On parametric linear and quadratic programming problems. mathematical Programming: Proceedings of the International Congress on Mathematical Programming, pp. 307-335, 1984.
22. Sindhwani, V., Keerthi, S., and Chapelle, O. Deterministic annealing for semi-supervised kernel machines. International Conference on Machine Learning, 2006.
23. Takeuchi, I., Nomura, K., and Kanamori, T. Non-parametric conditional density estimation using piecewise-linear solution path of kernel quantile regression. Neural Computation, 21(2):539-559, 2009.
24. Vapnik, V. N. The Nature of Statistical Learning Theory. Springer, 1996.
25. Vapnik, V. N. and Sterin, A. On structural risk minimization or overall risk in a problem of pattern recognition. Automation and Remote Control, 1977.
26. Yuille, A. L. and Rangarajan, A. The concave-convex procedure (cccp). In Advances in Neural Information Processing Systems, volume 14, 2002.