Variable sparsity kernel learning

Journal of Machine Learning Research

Volumn 12, Issue , 2011, Pages 565-592

  Aflalo, Jonathan ^a   Ben Tal, Aharon ^a   Bhattacharyya, Chiranjib ^b   Nath, Jagarlapudi Saketha ^c   Raman, Sankaran ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Mirror descent; Mixed norm; Multiple Kernel Learning; Object categorization; Scalability

Indexed keywords

KERNEL LEARNING; LEARNING TASKS; MIXED-NORM; MULTI-MODAL; MULTIPLE KERNEL LEARNING; NOVEL ALGORITHM; OBJECT CATEGORIZATION; TRAINING DATA;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; MIRRORS; SCALABILITY;

COMPUTATIONAL EFFICIENCY;

EID: 79952749920     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. F. Bach, G. R. G. Lanckriet, and M. I. Jordan. Multiple kernel learning, conic duality, and the SMO algorithm. In Proceedings of the International Conference on Machine Learning, 2004.
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 and A. Nemirovski. Lectures on modern convex optimization: Analysis, algorithms and engineering applications. MPS/SIAM Series on Optimization, 1, 2001.
4. A. Ben-Tal, T. Margalit, and A. Nemirovski. The ordered subsets mirror descent optimization method with applications to tomography. SIAM Journal of Optimization, 12(1):79-108, 2001.
5. A. C. Berg, T. L. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2005.
6. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, second edition, 1999.
7. C. Blake and C. Merz. Uci repository of machine learning databases, 1998. URL http://www.ics.uci.edu/~mlearn/MLRepository.html.
8. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
9. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 2006.
10. A. D'Aspermont. Smooth optimization with approximate gradient. SIAM Journal on Optimization, 19(3):1171-1183, 2008.
11. L. Fei-Fei, R. Fergus, and P. Perona. Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Workshop on Generative-Model Based Vision, 2004.
12. G. Griffin, A. Holub, and P. Perona. Caltech-256 object category dataset. Technical Report CNS-TR-2007-001, California Institute of Technology, 2007.
13. M. Kloft, U. Brefeld, S. Sonnenburg, and A. Zien. Non-sparse regularization and efficient training with multiple kernels. Technical Report UCB/EECS-2010-21, University of California, Berkeley, 2010.
14. 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.
15. S. Lazebnik, C. Schmid, and J. Ponce. Beyond bag of features: Spatial pyramid matching for recognizing natural scene categories. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2006.
16. C. A. Micchelli and M. Pontil. Learning the kernel function via regularization. Journal of Machine Learning Research, 6:1099-1125, 2005.
17. J. S. Nath, G. Dinesh, S. Raman, C. Bhattacharyya, A. Ben-Tal, and K. R. Ramakrishnan. On the algorithmics and applications of a mixed-norm regularization based kernel learning formulation. In Advances in Neural Information Processing Systems (NIPS), 2009.
18. M.-E. Nilsback and A. Zisserman. A visual vocabulary for flower classification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, volume 2, pages 1447-1454, 2006. (Pubitemid 44931490)
19. M.-E. Nilsback and A. Zisserman. Automated flower classification over a large number of classes. In Proceedings of the Sixth Indian Conference on Computer Vision, Graphics & Image Processing, 2008.
20. ∞ regularization. In Proceedings of the International Conference on Machine Learning, 2009.
21. A. Rakotomamonjy, F. Bach, S. Canu, and Y. Grandvalet. Simplemkl. Journal of Machine Learning Research, 9:2491-2521, 2008.
22. R. T. Rockafellar. Minimax theorems and conjugate saddle-functions. Mathematica Scandinava, 14:151-173, 1964.
23. R. T. Rockafellar. Convex Analysis. Princeton University Press, 1970.
24. E. Shechtman and M. Irani. Matching local self-similarities across images and videos. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2007.
25. M. Sion. On general minimax theorem. Pacific Journal of Mathematics, 1958.
26. S. Sonnenburg, G. Ratsch, C. Schafer, and B. Scholkopf. Large scale multiple kernel learning. Journal of Machine Learning Research, 7:1531-1565, 2006. (Pubitemid 44373694)
27. M. Szafranski, Y. Grandvalet, and A. Rakotomamonjy. Composite kernel learning. In Proceedings of the International Conference on Machine Learning, 2008.
28. P. Tseng. Convergence of a block coordinate descent method for nondifferentiable minimisation. Journal of Optimization Theory and Applications, 2001.
29. V. Vapnik. Statistical Learning Theory. Wiley-Interscience, 1998.
30. M. Varma and D. Ray. Learning the discriminative power invariance trade-off. In Proceedings of the International Conference on Computer Vision, 2007.
31. A. Vedaldi, V. Gulshan, M. Varma, and A. Zisserman. Multiple kernels for object detection. In Proceedings of the International Conference on Computer Vision, 2009.
32. H. Zhang, A. Berg, M. Maire, and J. Malik. Svm-knn: Discriminative nearest neighbor classication for visual category recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 2126-2136, 2006. (Pubitemid 44931577)