REVIEW 2 cited by
Group Lasso with Overlaps: the Latent Group Lasso approach
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We study a norm for structured sparsity which leads to sparse linear predictors whose supports are unions of prede ned overlapping groups of variables. We call the obtained formulation latent group Lasso, since it is based on applying the usual group Lasso penalty on a set of latent variables. A detailed analysis of the norm and its properties is presented and we characterize conditions under which the set of groups associated with latent variables are correctly identi ed. We motivate and discuss the delicate choice of weights associated to each group, and illustrate this approach on simulated data and on the problem of breast cancer prognosis from gene expression data.
Forward citations
Cited by 2 Pith papers
-
Proximal Iteration for Nonlinear Adaptive Lasso
A closed-form proximal operator for jointly updating coefficients and their adaptive Lasso penalties enables debiased variable selection with arbitrary sparsity structure in nonlinear models.
-
Graph-based Square-Root Estimation for Sparse Linear Regression
A graph-based square-root sparse regression estimator is proposed with sigma-free tuning, finite-sample bounds, asymptotic normality, and selection consistency.
Discussion (0). Continue with ORCID to comment.