Structured sparsity through convex optimization
From MaRDI portal
Abstract: Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. While naturally cast as a combinatorial optimization problem, variable or feature selection admits a convex relaxation through the regularization by the -norm. In this paper, we consider situations where we are not only interested in sparsity, but where some structural prior knowledge is available as well. We show that the -norm can then be extended to structured norms built on either disjoint or overlapping groups of variables, leading to a flexible framework that can deal with various structures. We present applications to unsupervised learning, for structured sparse principal component analysis and hierarchical dictionary learning, and to supervised learning in the context of non-linear variable selection.
Recommendations
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- 10.1162/jmlr.2003.3.4-5.993
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Adapting to Unknown Smoothness via Wavelet Shrinkage
- An introduction to support vector machines and other kernel-based learning methods.
- Atomic Decomposition by Basis Pursuit
- Component selection and smoothing in multivariate nonparametric regression
- Consistency of the group Lasso and multiple kernel learning
- Convex analysis and nonlinear optimization. Theory and examples.
- Coordinate descent algorithms for lasso penalized regression
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Grouping pursuit through a regularization solution surface
- High dimensional inverse covariance matrix estimation via linear programming
- High-dimensional graphs and variable selection with the Lasso
- scientific article; zbMATH DE number 5971198 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 1465030 (Why is no real title available?)
- scientific article; zbMATH DE number 1931821 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6253954 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Just relax: convex programming methods for identifying sparse signals in noise
- Learning with Structured Sparsity
- Learning with submodular functions: a convex optimization perspective
- Least angle regression. (With discussion)
- Model Selection and Estimation in Regression with Grouped Variables
- Model-Based Compressive Sensing
- Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonlinear total variation based noise removal algorithms
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Online learning for matrix factorization and sparse coding
- Optimal solutions for sparse principal component analysis
- Optimization with sparsity-inducing penalties
- Oracle inequalities and optimal inference under group sparsity
- Pathwise coordinate optimization
- Proximal methods for hierarchical sparse coding
- Proximal splitting methods in signal processing
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Simultaneous analysis of Lasso and Dantzig selector
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
- Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block $\ell _{1}/\ell _{\infty} $-Regularization
- Smoothing proximal gradient method for general structured sparse regression
- Some results on Tchebycheffian spline functions and stochastic processes
- Some sharp performance bounds for least squares regression with L₁ regularization
- Sparse Reconstruction by Separable Approximation
- Sparsity and Smoothness Via the Fused Lasso
- Structured variable selection with sparsity-inducing norms
- Support union recovery in high-dimensional multivariate regression
- The Adaptive Lasso and Its Oracle Properties
- The benefit of group sparsity
- The composite absolute penalties family for grouped and hierarchical variable selection
- The elements of statistical learning. Data mining, inference, and prediction
- THE NATURE OF POWER CORRECTIONS IN LARGE-β0 APPROXIMATION
- The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchies
- Theoretical properties of the overlapping groups Lasso
- Trading accuracy for sparsity in optimization problems with sparsity constraints
Cited in
(72)- Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
- A note on ``Reguralizers for structured sparsity
- Hierarchical sparse modeling: a choice of two group Lasso formulations
- Coordinate descent based hierarchical interactive Lasso penalized logistic regression and its application to classification problems
- Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space
- Fast projections onto mixed-norm balls with applications
- Regularizers for structured sparsity
- Convergence of stochastic proximal gradient algorithm
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- On the convergence of a class of inertial dynamical systems with Tikhonov regularization
- Optimization of structural similarity in mathematical imaging
- Structured iterative hard thresholding with on- and off-grid applications
- Weighted thresholding homotopy method for sparsity constrained optimization
- A nested primal-dual FISTA-like scheme for composite convex optimization problems
- Hierarchical isometry properties of hierarchical measurements
- How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning
- Group collaborative representation for image set classification
- Robust classification via MOM minimization
- Structured sparsity promoting functions
- Network classification with applications to brain connectomics
- On integer and MPCC representability of affine sparsity
- GenePEN: analysis of network activity alterations in complex diseases via the pairwise elastic net
- Learning with optimal interpolation norms
- Structural properties of affine sparsity constraints
- Robust multi-image processing with optimal sparse regularization
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Estimation in high dimensions: a geometric perspective
- An analysis of penalized interaction models
- Structured sparsity: discrete and convex approaches
- Restricted normal cones and sparsity optimization with affine constraints
- Iterative positive thresholding algorithm for non-negative sparse optimization
- Learning the Structure for Structured Sparsity
- Convex geometry of quantum resource quantification
- Sparse Regularization via Convex Analysis
- Generalized conditional gradient for sparse estimation
- Fast algorithms for structured sparsity (ICALP 2015 invited tutorial)
- Sparsity method for network structure of broad learning system based on lasso and elastic net
- A Pliable Lasso
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure
- Proximal Optimization for Fuzzy Subspace Clustering
- Sparse and switching infinite horizon optimal controls with mixed-norm penalizations
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- High dimensional forecasting via interpretable vector autoregression
- Robust high dimensional learning for Lipschitz and convex losses
- On sparsity inducing regularization methods for machine learning
- scientific article; zbMATH DE number 6253954 (Why is no real title available?)
- Structured variable selection with sparsity-inducing norms
- Learning with Structured Sparsity
- Structured sparsity and generalization
- Structured sparsity via alternating direction methods
- Weakly decomposable regularization penalties and structured sparsity
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
- Introduction to the special issue on sparsity and regularization methods
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- Poststratification fusion learning in longitudinal data analysis
- A sparse additive model for high-dimensional interactions with an exposure variable
- A dynamic screening algorithm for hierarchical binary marketing data
- Analysis of a variable metric block coordinate method under proximal errors
- Efficient interaction selection for clustered data via stagewise generalized estimating equations
- Sparse and integrative principal component analysis for multiview data
- Convergence analysis of a primal-dual optimization-by-continuation algorithm
- Enhancing sparse identification of nonlinear dynamics with Earth-mover distance and group similarity
- Predicting census survey response rates with parsimonious additive models and structured interactions
- A nested primal-dual iterated Tikhonov method for regularized convex optimization
- Optimization and learning with randomly compressed gradient updates
- A preconditioned version of a nested primal-dual algorithm for image deblurring
- Multilevel Preconditioning Strategies for Convex Optimization Methods in Image Deblurring
- Recovery bounds for cardinality regularized optimization problem
- Convex relaxations of penalties for sparse correlated variables with bounded total variation
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
This page was built for publication: Structured sparsity through convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5965303)
