Sparsity with sign-coherent groups of variables via the cooperative-Lasso
Julien Chiquet, Yves Grandvalet, Camille Charbonnier

TL;DR
This paper introduces the cooperative-Lasso, a new penalty for estimating parameters with sign-coherent group structures, improving support recovery and model selection in high-dimensional settings.
Contribution
The paper proposes the cooperative-Lasso penalty, derives optimality conditions, and demonstrates its advantages over existing methods in theory and simulations.
Findings
Improves support recovery for sign-coherent groups.
Milder irrepresentable conditions than group-Lasso.
Effective in applications like ordinal data and genomic analysis.
Abstract
We consider the problems of estimation and selection of parameters endowed with a known group structure, when the groups are assumed to be sign-coherent, that is, gathering either nonnegative, nonpositive or null parameters. To tackle this problem, we propose the cooperative-Lasso penalty. We derive the optimality conditions defining the cooperative-Lasso estimate for generalized linear models, and propose an efficient active set algorithm suited to high-dimensional problems. We study the asymptotic consistency of the estimator in the linear regression setup and derive its irrepresentable conditions, which are milder than the ones of the group-Lasso regarding the matching of groups with the sparsity pattern of the true parameters. We also address the problem of model selection in linear regression by deriving an approximation of the degrees of freedom of the cooperative-Lasso estimator.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
