2016
DOI: 10.1051/ps/2015020
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: We consider the problem of estimating a function f 0 in logistic regression model.We propose to estimate this function f 0 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 [4].

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 35 publications
0
18
0
Order By: Relevance
“…Applying Bach's (2010) Lemma 1 to each observation, as in Belloni, Chernozhukov, and Wei (2013) Kwemou (2012) also applied Bach's (2010) to study sparse logistic regression…”
Section: Supplemental Appendix For "Robust Inference On Average Treatmentioning
confidence: 99%
See 1 more Smart Citation
“…Applying Bach's (2010) Lemma 1 to each observation, as in Belloni, Chernozhukov, and Wei (2013) Kwemou (2012) also applied Bach's (2010) to study sparse logistic regression…”
Section: Supplemental Appendix For "Robust Inference On Average Treatmentioning
confidence: 99%
“…Bach (2010) only gives an error bound on coefficients in exactly sparse logistic regression, which can not yield our results; and does not consider prediction error or post-selection estimation. In independent work,(Kwemou 2012) andBelloni, Chernozhukov, and Wei (2013) also apply Bach's (2010) tools, but are focused on a different goals Vincent and Hansen (2014). apply the group lasso to multinomial logistic regression, but do not derive any theoretical results.…”
mentioning
confidence: 99%
“…In linear models, these results include Bunea et al (2007) for prediction error of LASSO, Bickel et al (2009) for prediction error of both LASSO and Dantzig selector as well as bounds on estimation error, and Koltchinskii et al (2011) for a sharp oracle inequality of prediction error. Some parallel results have been developed for generalized linear models, including but not limited to, Van de Geer (2008), Bach (2010) and Kwemou (2012). In this subsection, we establish the oracle inequalities for pLASSO in the framework of generalized linear models, including its excess risk and estimation error.…”
Section: Theoretical Propertiesmentioning
confidence: 99%
“…The first part of Condition E was employed by Kwemou (2012) when they derived oracle inequalities for LASSO. The second part of Condition E, justified by Jiang and Zhang (2013), is used here to control the probability with which the oracle inequalities hold, by applying Bernstein’s inequality [e.g., Lemma 2.2.11 in van der Vaart and Wellner (1996)].…”
Section: Theoretical Propertiesmentioning
confidence: 99%
“…This condition is weaker than Assumption D in Cheng et al (2016), which requires ρ p O n n log = ( log ) 1 5 ∕ . Condition (B) has been commonly assumed in the literature for variable selection and screening (Zhao and Li, 2012;Kwemou, 2016;Li et al, 2016). The uniform boundedness of X is adopted to simplify our theoretical development and can be relaxed to Conditions (B) and (D) in Fan and Song (2010).…”
Section: Introductionmentioning
confidence: 99%