A randomized mirror descent algorithm for large scale multiple kernel learning

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 374-382

  Afkanpour, Arash ^a   György, András ^a   Szepesvári, Csaba ^a   Bowling, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; MIRRORS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS;

COMBINATORIAL STRUCTURES; COMPUTATIONAL COSTS; COMPUTATIONALLY EFFICIENT; E-OPTIMAL; EMPIRICAL RISKS; MULTIPLE KERNEL LEARNING; POLYNOMIAL KERNELS; PROBABILITY PROPORTIONAL;

COMPUTATIONAL EFFICIENCY;

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

References (31)

1. Afkanpour, A., György, A., Szepesvári, C., and Bowling, M. H. (2013). A randomized mirror descent algorithm for large scale multiple kernel learning. CoRR, abs/1205.0288.
2. Argyriou, A., Hauser, R., Micchelli, C., and Pontil, M. (2006). A DC-programming algorithm for kernel selection. In Proceedings of the 23rd International Conference on Machine Learning, pages 41-48.
3. Argyriou, A., Micchelli, C., and Pontil, M. (2005). Learning convex combinations of continuously parameterized basic kernels. In Proceedings of the 18th Annual Conference on Learning Theory, pages 338-352.
4. Aronszajn, N. (1950). Theory of reproducing kernels. Transactions of the American Mathematical Society, 68(3):337-404.
5. Bach, F. (2008). Exploring large feature spaces with hierarchical multiple kernel learning. In Advances in Neural Information Processing Systems, volume 21, pages 105-112.
6. Beck, A. and Teboulle, M. (2003). Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3):167175.
7. Cortes, C., Mohri, M., and Rostamizadeh, A. (2009). Learning non-linear combinations of kernels. In Advances in Neural Information Processing Systems, volume 22, pages 396-404.
8. Frank, A. and Asuncion, A. (2010). UCI machine learning repository.
9. Gehler, P. and Nowozin, S. (2008). Infinite kernel learning. Technical Report 178, Max Planck Institute For Biological Cybernetics.
10. Gönen, M. and Alpaydin, E. (2011). Multiple kernel learning algorithms. Journal of Machine Learning Research, 12:2211-2268.
11. Hastie, T., Tibshirani, R., and Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, Prediction. Springer, 2nd edition.
12. Hazan, E., Agarwal, A., and Kale, S. (2007). Logarithmic regret algorithms for online convex optimization. Machine Learning Journal, 69(2-3):169-192. (Pubitemid 47574314)
13. Hazan, E. and Kale, S. (2011). Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization. In Proceedings of the 24th Annual Conference on Learning Theory, volume 19 of JMLR Workshop and Conference Proceedings, pages 421-436.
14. p-norm multiple kernel learning. Journal of Machine Learning Research, 12:953-997.
15. Martinet, B. (1978). Perturbation des méthodes d'optimisation. Applications. RAIRO Analyse Numérique, 12:153-171.
16. Micchelli, C. and Pontil, M. (2005). Learning the kernel function via regularization. Journal of Machine Learning Research, 6:1099-1125.
17. Nath, J., Dinesh, G., Raman, S., Bhattacharyya, C., Ben-Tal, A., and Ramakrishnan, K. (2009). On the algorithmics and applications of a mixed-norm based kernel learning formulation. In Advances in Neural Information Processing Systems, volume 22, pages 844-852.
18. Nemirovski, A., Juditsky, A., Lan, G., and Shapiro, A. (2009). Robust stochastic approximation approach to stochastic programming. SIAM J. Optimization, 4:1574-1609.
19. Nemirovski, A. and Yudin, D. (1998). Problem Complexity and Method Efficiency in Optimization. Wiley.
20. Nesterov, Y. (2010). Efficiency of coordinate descent methods on huge-scale optimization problems. CORE Discussion paper, (2010/2).
21. Nesterov, Y. (2012). Subgradient methods for huge-scale optimization problems. CORE Discussion paper, (2012/2).
22. Orabona, F. and Luo, J. (2011). Ultra-fast optimization algorithm for sparse multi kernel learning. In Proceedings of the 28th International Conference on Machine Learning, pages 249-256.
23. Rakotomamonjy, A., Bach, F., Canu, S., and Grandvalet Y. (2008). SimpleMKL. Journal of Machine Learning, 9:2491-2521.
24. Richtárik, P. and Takáĉ, M. (2011). Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. (revised July 4, 2011) submitted to Mathematical Programming.
25. Rockafellar, R. (1976). Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14(1):877-898.
26. Schölkopf, B. and Smola, A. (2002). Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge, MA, USA.
27. 1-regularized loss minimization. Journal of Machine Learning Research, 12:1865-1892.
28. Shawe-Taylor, J. and Cristianini, N. (2004). Kernel Methods for Pattern Analysis. Cambridge Univ Press.
29. Sonnenburg, S., Rätsch, G., Schäfer, C., and Schölkopf, B. (2006). Large scale multiple kernel learning. The Journal of Machine Learning Research, 7:1531-1565. (Pubitemid 44373694)
30. Xu, Z., Jin, R., King, I., and Lyu, M. (2008). An extended level method for efficient multiple kernel learning. In Advances in Neural Information Processing Systems, volume 21, pages 1825-1832.
31. Xu, Z., Jin, R., Yang, H., King, I., and Lyu, M. R. (2010). Simple and efficient multiple kernel learning by group lasso. In Proceedings of the 27th International Conference on Machine Learning, pages 1175-1182.