Learning with infinitely many features

Machine Learning

Volumn 91, Issue 1, 2013, Pages 43-66

  Rakotomamonjy, A ^a   Flamary, R ^b   Yger, F ^a  

^a UNIVERSITÉ ET INSA DE ROUEN   (France)

^b UNIVERSITÉ DE NICE SOPHIA ANTIPOLIS   (France)

Author keywords

Column generation; Gabor features; Infinite features; Kernels

Indexed keywords

COLUMN GENERATION; COMPUTER VISION PROBLEMS; FEATURE EXTRACTION METHODS; GABOR FEATURE; INFINITE FEATURES; KERNELS; OPTIMALITY CONDITIONS; TEXTURE CLASSIFICATION;

FEATURE EXTRACTION;

CLASSIFICATION (OF INFORMATION);

EID: 84875440925     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-012-5324-5     Document Type: Article

References (40)

1. Argyriou, A.; Micchelli, C.; & Pontil, M. (2005). Learning convex combinations of continuously parameterized basic kernels. In Proceedings of COLT'2005 (pp. 338-352).
2. Argyriou, A.; Hauser, R.; Micchelli, C.; & Pontil, M. (2006). A dc-programming algorithm for kernel selection. In Proc. international conference in machine learning.
3. Argyriou, A.; Evgeniou, T.; & Pontil, M. (2008a). Convex multi-task feature learning. Machine Learning, 73(3), 243-272.
4. Argyriou, A.; Maurer, A.; & Pontil, M. (2008b). An algorithm for transfer learning in a heterogeneous environment. In Proceedings of the European conference on machine learning.
5. Argyriou, A.; Micchelli, C.; & Pontil, M. (2009). When is there a representer theorem? Vector versus matrix regularizers. Journal of Machine Learning Research, 10, 2507-2529.
6. Bach, F.; & Jordan, M. (2005). Predictive low-rank decomposition for kernel methods. In Proceedings of the 22nd international conference on machine learning.
7. Beck, A.; & Teboulle, M. (2009). A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2, 183-202.
8. Bengio, Y. (2009). Learning deep architectures for AI. Foundations and Trends in Machine Learning, 2(1), 1-127.
9. Bianconi, F.; & Fernandez, A. (2007). Evaluation of the effects of Gabor filter parameters on texture classification. Pattern Recognition, 40(12), 3325-3335.
10. Bordes, A.; Ertekin, S.; Weston, J.; & Bottou, L. (2005). Fast kernel classifiers with online and active learning. Journal of Machine Learning Research, 6, 1579-1619.
11. Boyd, S.; Parikh, N.; Chu, E.; Peleato, B.; & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3, 1-122.
12. Chapelle, O.P.S.; Vadrevu, S.; Weinberger, K.; Zhang, Y.; & Tseng, B. (2011). Boosted multi-task learning. Machine Learning, 85(1-2), 149-173.
13. Chen, X.; Pan, W.; Kwok, J.; & Carbonell, J. (2009). Accelerated gradient method for multi-task sparse learning problem. In Proceedings of the international conference on data mining.
14. Choi, W.-P.; Tse, S.-H.; Wong, K.-W.; & Lam, K.-M. (2008). Simplified Gabor wavelets for human face recognition. Pattern Recognition, 41(3), 1186-1199.
15. Clausi, D.; & Jernigan, M. (2000). Designing Gabor filters for optimal texture separability. Pattern Recognition, 33(11), 1835-1849.
16. Cortes, C.; Mohri, M.; & Rostamizadeh, A. (2010). Generalization bounds for learning kernels. In Proceedings of the 27th annual international conference on machine learning.
17. Demiriz, A.; Bennett, K.; & Shawe-Taylor, J. (2002). Linear programming boosting via column generation. Machine Learning, 46, 225-254.
18. Eckstein, J.; & Bertsekas, D. (1992). On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming, 5, 293-318.
19. Evgeniou, T.; & Pontil, M. (2004). Regularized multi-task learning. In Proceedings of the tenth conference on knowledge discovery and data mining.
20. Gehler, P.; & Nowozin, S. (2008). Infinite kernel learning. In NIPS workshop on automatic selection of kernel parameters.
21. Gehler, P.; & Nowozin, S. (2009). Let the kernel figure it out: principled learning of pre-processing for kernel classifiers. In Proceedings of the IEEE computer society conference on computer vision and pattern recognition.
22. Jalali, A.; Ravikumar, P.; Sanghavi, S.; & Ruan, C. (2010). A dirty model for multitask learning. In Advances in neural information processing systems (NIPS).
23. Lanckriet, G.; Cristianini, N.; El Ghaoui, L.; Bartlett, P.; & Jordan, M. (2004). Learning the kernel matrix with semi-definite programming. Journal of Machine Learning Research, 5, 27-72.
24. Lee, H.; Largman, Y.; Pham, P.; & Ng, A. (2009). Unsupervised feature learning for audio classification using convolutional deep belief networks. In Advances in neural information and processing systems.
25. Mason, L.; Baxter, J.; Bartlett, P.; & Frean, M. (1999). Boosting algorithms as gradient descent in function space. In Neural information processing systems.
26. Mota, J.; Xavier, J.; Aguiar, P.; & Puschel, M. (2011). A proof of convergence for the alternating direction method of multipliers applied to polyhedral-constrained functions (Technical report). arXiv:1112.2295.
27. Neumann, J.; Schnorr, C.; & Steidl, G. (2005). Efficient wavelet adaptation for hybrid wavelet-large margin classifiers. Pattern Recognition, 38(11), 1815-1830.
28. Nocedal, J.; & Wright, S. (2000). Numerical optimization. Berlin: Springer.
29. Obozinski, G.; Taskar, B.; & Jordan, M. (2010). Joint covariate selection and joint subspace selection for multiple classification problems. Statistics and Computing, 20, 231-252.
30. Ozogur-Akyuz, S.; & Weber, G. (2008). Learning with infinitely many kernels via semi-infinite programming. In Proceedings of Euro mini conference on "Continuous optimization and knowledge based technologies" (pp. 342-348).
31. Rahimi, A.; & Recht, B. (2007). Random features for large-scale kernel machines. In Advances in neural information processing systems (NIPS) (pp. 1177-1184).
32. q penalty for sparse linear and sparse multiple kernel multi-task learning. IEEE Transactions on Neural Networks, 22(8), 1307-1320.
33. 1 regularization in infinite dimensional feature spaces. In Proceedings of computational learning theory (pp. 544-558).
34. Serre, T.; Wolf, L.; Bileschi, S.; Riesenhuber, M.; & Poggio, T. (2007). Object recognition with cortex-like mechanisms. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(3), 411-426.
35. Shen, C.; & Li, H. (2010). On the dual formulation of boosting algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(12), 2216-2231.
36. Vedaldi, A.; & Zisserman, A. (2010). Efficient additive kernels via explicit feature maps. In Proceedings of the IEEE conf. on computer vision and pattern recognition (CVPR).
37. Wang, J.; Lu, H.; Plataniotis, K.; & Lu, J. (2009). Gaussian kernel optimization for pattern recognition. Pattern Recognition, 42(7), 1237-1247.
38. Yeung, D.-Y.; Chang, H.; & Dai, G. (2007). Learning the kernel matrix by maximizing a kfd-based class separability criterion. Pattern Recognition, 40(7), 2021-2028.
39. Yger, F.; & Rakotomamonjy, A. (2011). Wavelet kernel learning. Pattern Recognition, 44, 2614-2629.
40. Ying, Y.; & Campbell, C. (2009). Generalization bounds for learning the kernel. In Proceedings of 22nd annual conference on learning theory (COLT).