Lasso type classifiers with a reject option

We consider the problem of binary classification where one can, for a particular cost, choose not to classify an observation. We present a simple proof for the oracle inequality for the excess risk of structural risk minimizers using a lasso type penalty.

[1]  M. Talagrand,et al.  Probability in Banach spaces , 1991 .

[2]  Yoshua Bengio,et al.  Pattern Recognition and Neural Networks , 1995 .

[3]  B. Ripley,et al.  Pattern recognition and neural networks , 1996 .

[4]  S. Geer.  Empirical Processes in M-Estimation , 2000 .

[5]  Luc Devroye,et al.  Combinatorial methods in density estimation , 2001, Springer series in statistics.

[6]  Gábor Lugosi,et al.  Introduction to Statistical Learning Theory , 2004, Advanced Lectures on Machine Learning.

[7]  A. Tsybakov,et al.  Optimal aggregation of classifiers in statistical learning , 2003 .

[8]  Florentina Bunea,et al.  Two‐stage model selection procedures in partially linear regression , 2004 .

[9]  O. Bousquet.  THEORY OF CLASSIFICATION: A SURVEY OF RECENT ADVANCES , 2004 .

[10]  S. Boucheron,et al.  Theory of classification : a survey of some recent advances , 2005 .

[11]  Radu Herbei,et al.  Classification with reject option , 2006 .

[12]  S. Geer,et al.  Classifiers of support vector machine type with \ell1 complexity regularization , 2006 .

[13]  Florentina Bunea,et al.  Aggregation and sparsity via 1 penalized least squares , 2006 .

[14]  Florentina Bunea,et al.  Sparse Density Estimation with l1 Penalties , 2007, COLT.

[15]  A. Tsybakov,et al.  Aggregation for Gaussian regression , 2007, 0710.3654.

[16]  A. Tsybakov,et al.  Sparsity oracle inequalities for the Lasso , 2007, 0705.3308.

[17]  S. Geer.  HIGH-DIMENSIONAL GENERALIZED LINEAR MODELS AND THE LASSO , 2008, 0804.0703.

[18]  Peter L. Bartlett,et al.  Classification with a Reject Option using a Hinge Loss , 2008, J. Mach. Learn. Res..