Learning with infinitely many features - Archive ouverte HAL Access content directly
Journal Articles Machine Learning Year : 2012

Learning with infinitely many features


We propose a principled framework for learning with infinitely many features, situations that are usually induced by continuously parametrized feature extraction methods. Such cases occur for instance when considering Gabor-based features in computer vision problems or when dealing with Fourier features for kernel approximations. We cast the problem as the one of finding a finite subset of features that minimizes a regularized empirical risk. After having analyzed the optimality conditions of such a problem, we propose a simple algorithm which has the avour of a column-generation technique. We also show that using Fourier-based features, it is possible to perform approximate infinite kernel learning. Our experimental results on several datasets show the benefits of the proposed approach in several situations including texture classification and large-scale kernelized problems (involving about 100 thousand examples).
Fichier principal
Vignette du fichier
ml2012.pdf (594.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00735926 , version 1 (27-09-2012)


  • HAL Id : hal-00735926 , version 1


Alain Rakotomamonjy, Rémi Flamary, Florian Yger. Learning with infinitely many features. Machine Learning, 2012. ⟨hal-00735926⟩
273 View
148 Download


Gmail Facebook Twitter LinkedIn More