Non-asymptotic oracle inequalities for the Lasso and Group Lasso in high dimensional logistic model

We consider the problem of estimating a function f0 in logistic regression model. We propose to estimate this function f0 by a sparse approximation build as a linear combination of elements of a given dictionary of p functions. This sparse approximation is selected by the Lasso or Group Lasso procedure. In this context, we state non asymptotic oracle inequalities for Lasso and Group Lasso under restricted eigenvalue assumption as introduced in [P.J. Bickel, Y. Ritov and A.B. Tsybakov, Ann. Statist. 37 (2009) 1705–1732]