A note on the group lasso and a sparse group lasso
read the original abstract
We consider the group lasso penalty for the linear model. We note that the standard algorithm for solving the problem assumes that the model matrices in each group are orthonormal. Here we consider a more general penalty that blends the lasso (L1) with the group lasso ("two-norm"). This penalty yields solutions that are sparse at both the group and individual feature levels. We derive an efficient algorithm for the resulting convex problem based on coordinate descent. This algorithm can also be used to solve the general form of the group lasso, with non-orthonormal model matrices.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Beyond Shrinkage: Foundations of Data-Driven Control for Piecewise Affine Systems
Foundations for DeePC on PWA systems via behavioral theory, Fundamental Lemma extension, coherence analysis with shrinkage, and misclassification study, validated on a simple numerical example.
-
Nonparametric f-Modeling for Empirical Bayes Inference with Unequal and Unknown Variances
A generalized Tweedie identity and moment-generating-function representation enable nonparametric recovery of full posteriors for heteroscedastic normal means with unknown variances without specifying a prior.
-
S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection
S2MAM is a new semi-supervised model that uses bilevel optimization to automatically identify informative variables, update similarity matrices, and provide interpretable predictions with theoretical guarantees.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.