Group Lasso with Overlaps: the Latent Group Lasso approach

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.

References in corpus (5)

• Consistency of the group Lasso and multiple kernel learning
• Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
• Sharp thresholds for high-dimensional and noisy recovery of sparsity
• Convex Relaxation for Combinatorial Penalties
• Union Support Recovery in Multi-task Learning

Cited by in corpus (24)

• A lasso for hierarchical interactions
• Convex Tensor Decomposition via Structured Schatten Norm Regularization
• More power via graph-structured tests for differential expression of gene networks
• Structured sparsity-inducing norms through submodular functions
• Hierarchical Sparse Modeling: A Choice of Two Group Lasso Formulations
• Convex Relaxation for Combinatorial Penalties
• Sparse Overlapping Sets Lasso for Multitask Learning and its Application to fMRI Analysis
• An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints
• Signal Recovery in Unions of Subspaces with Applications to Compressive Imaging
• Joint Network Topology Inference in the Presence of Hidden Nodes
• Convex Estimation of Sparse-Smooth Power Spectral Densities from Mixtures of Realizations with Application to Weather Radar
• Classification with Sparse Overlapping Groups
• A totally unimodular view of structured sparsity
• The geometry of least squares in the 21st century
• High Precision TOA-based Direct Localization of Multiple Sources in Multipath
• Regularization for Design
• Group-sparse SVD Models and Their Applications in Biological Data
• Lower Bound Convex Programs for Exact Sparse Optimization
• A first-order optimization algorithm for statistical learning with hierarchical sparsity structure
• Learning a Common Substructure of Multiple Graphical Gaussian Models
• Estimation of Graphical Models through Structured Norm Minimization
• A likelihood-based approach for multivariate categorical response regression in high dimensions
• Survival Analysis with Graph-Based Regularization for Predictors
• Robust Pedestrian Attribute Recognition Using Group Sparsity for Occlusion Videos