Pith. sign in

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

arxiv 1110.0413 v1 pith:OHXFLFIC submitted 2011-10-03 stat.ML cs.LG

classification stat.MLcs.LG
keywords grouplassolatentvariablesapproachassociateddatagroups
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Proximal Iteration for Nonlinear Adaptive Lasso

    stat.ML 2024-12 conditional novelty 6.0 of 10

    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.

  2. Graph-based Square-Root Estimation for Sparse Linear Regression

    stat.ME 2024-11 conditional novelty 5.0 of 10

    A graph-based square-root sparse regression estimator is proposed with sigma-free tuning, finite-sample bounds, asymptotic normality, and selection consistency.

Pith tools