Abstract
We propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is found by using a sparsity inducing empirical risk, which is a relaxation of the standard L 0 regularized risk. The classification problem is modeled as a sequential decision process that sequentially chooses, for each datapoint, which features to use before classifying. Datum-Wise Classification extends naturally to multi-class tasks, and we describe a specific case where our inference has equivalent complexity to a traditional linear classifier, while still using a variable number of features. We compare our classifier to classical L 1 regularized linear models (L 1-SVM and LARS) on a set of common binary and multi-class datasets and show that for an equal average number of features used we can get improved performance using our method.
This work was partially supported by the French National Agency of Research (Lampada ANR-09-EMER-007).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Tibshirani, R.: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (January 1994)
Sutton, R., Barto, A.: Reinforcement Learning. MIT Press, Cambridge (1998)
Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least-angle regression. Annals of statistics 32(2), 407–499 (2004)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Chichester (1994)
Har-Peled, S., Roth, D., Zimak, D.: Constraint classification: A new approach to multiclass classification. Algorithmic Learning Theory, 1–11 (2002)
Lagoudakis, M.G., Parr, R.: Reinforcement learning as classification: Leveraging modern classifiers. In: ICML 2003 (2003)
Fan, R., Chang, K., Hsieh, C., Wang, X., Lin, C.: LIBLINEAR: A library for large linear classification. JMLR 9, 1871–1874 (2008)
Guyon, I., Elisseefi, A.: An Introduction to Variable and Feature Selection. Journal of Machine Learning Research 3(7-8), 1157–1182 (2003)
Girgin, S., Preux, P.: Feature discovery in reinforcement learning using genetic programming. In: O’Neill, M., Vanneschi, L., Gustafson, S., Esparcia Alcázar, A.I., De Falco, I., Della Cioppa, A., Tarantino, E. (eds.) EuroGP 2008. LNCS, vol. 4971, pp. 218–229. Springer, Heidelberg (2008)
Gaudel, R., Sebag, M.: Feature Selection as a One-Player Game. In: ICML (2010)
Xu, Z., Zhang, H., Wang, Y., Chang, X., Liang, Y.: L1/2 regularization. Science China Information Sciences 53(6), 1159–1169 (2010)
Ertin, E.: Reinforcement learning and design of nonparametric sequential decision networks. In: Proceedings of SPIE, pp. 40–47 (2002)
Ji, S., Carin, L.: Cost-sensitive feature acquisition and classification. Pattern Recognition 40(5), 1474–1485 (2007)
Póczos, B., Abbasi-Yadkori, Y., Szepesvári, C., Greiner, R., Sturtevant, N.: Learning when to stop thinking and do something! In: ICML 2009, pp. 1–8 (2009)
Dulac-Arnold, G., Denoyer, L., Gallinari, P.: Text Classification: A Sequential Reading Approach. In: ECIR, pp. 411–423 (2011)
Preda, M.: Adaptive building of decision trees by reinforcement learning. In: Proceedings of the 7th WSEAS, pp. 34–39 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dulac-Arnold, G., Denoyer, L., Preux, P., Gallinari, P. (2011). Datum-Wise Classification: A Sequential Approach to Sparsity. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2011. Lecture Notes in Computer Science(), vol 6911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23780-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-23780-5_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23779-9
Online ISBN: 978-3-642-23780-5
eBook Packages: Computer ScienceComputer Science (R0)