Structured variable selection with sparsity-inducing norms
From MaRDI portal
Publication:5396702
zbMATH Open1280.68170arXiv0904.3523MaRDI QIDQ5396702FDOQ5396702
Authors: Rodolphe Jenatton, Jean-Yves Audibert, Francis Bach 
Publication date: 3 February 2014
Full work available at URL: https://arxiv.org/abs/0904.3523
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Ridge regression; shrinkage estimators (Lasso) (62J07)
Cited In (60)
- Simultaneous nonparametric regression in RADWT dictionaries
- Grouping strategies and thresholding for high dimensional linear models
- More power via graph-structured tests for differential expression of gene networks
- Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO
- Hierarchical sparse modeling: a choice of two group Lasso formulations
- Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
- Feature selection with SVD entropy: some modification and extension
- Sparsity Constrained Estimation in Image Processing and Computer Vision
- On integer and MPCC representability of affine sparsity
- A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications
- Discrete optimization methods for group model selection in compressed sensing
- Theoretical properties of the overlapping groups Lasso
- Overlapping group lasso for high-dimensional generalized linear models
- An efficient denoising framework using weighted overlapping group sparsity
- Title not available (Why is that?)
- A Single-Phase, Proximal Path-Following Framework
- Robust multi-image processing with optimal sparse regularization
- Optimization problems involving group sparsity terms
- Two-level structural sparsity regularization for identifying lattices and defects in noisy images
- Information criteria for variable selection under sparsity
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- Proximal methods for the latent group lasso penalty
- Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure
- Low Complexity Regularization of Linear Inverse Problems
- Sparse pathway-based prediction models for high-throughput molecular data
- Regularizers for structured sparsity
- Title not available (Why is that?)
- A lasso for hierarchical interactions
- Investigating consumers' store-choice behavior via hierarchical variable selection
- Robust grouped variable selection using distributionally robust optimization
- Multi-cue illumination estimation via a tree-structured group joint sparse representation
- Sequential approaches for learning datum-wise sparse representations
- Degrees of freedom in submodular regularization: a computational perspective of Stein's unbiased risk estimate
- An alternating direction and projection algorithm for structure-enforced matrix factorization
- Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm
- Tree-guided group lasso for multi-response regression with structured sparsity, with an application to eQTL mapping
- Sparsity considerations for dependent variables
- Oracle Inequalities for Local and Global Empirical Risk Minimizers
- Structured Sparsity: Discrete and Convex Approaches
- Smoothing proximal gradient method for general structured sparse regression
- Structured sparsity through convex optimization
- A smoothing stochastic gradient method for composite optimization
- Sparse conditional copula models for structured output regression
- Supersparse linear integer models for optimized medical scoring systems
- Hierarchical isometry properties of hierarchical measurements
- New convergence results for the inexact variable metric forward-backward method
- Sparse structure selection and estimation
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- Coordinate descent based hierarchical interactive Lasso penalized logistic regression and its application to classification problems
- Convex Optimization for Group Feature Selection in Networked Data
- Tail inverse regression: dimension reduction for prediction of extremes
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Locally Sparse Function-on-Function Regression
- Structured learning in time-dependent Cox models
- Estimation of banded time-varying precision matrix based on SCAD and group Lasso
- Doubly structured sparsity for grouped multivariate responses with application to functional outcome score modeling
- Back-propagating errors through artificial neural networks for variable selection
- A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity
- Feature grouping and sparse principal component analysis with truncated regularization
Uses Software
This page was built for publication: Structured variable selection with sparsity-inducing norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396702)
