Structured variable selection with sparsity-inducing norms
From MaRDI portal
(Redirected from Publication:5396702)
Recommendations
Cited in
(70)- Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
- Two-level structural sparsity regularization for identifying lattices and defects in noisy images
- Sparse pathway-based prediction models for high-throughput molecular data
- An alternating direction and projection algorithm for structure-enforced matrix factorization
- 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
- Simultaneous nonparametric regression in RADWT dictionaries
- Multi-cue illumination estimation via a tree-structured group joint sparse representation
- Sequential approaches for learning datum-wise sparse representations
- Regularizers for structured sparsity
- Theoretical properties of the overlapping groups Lasso
- Sparsity considerations for dependent variables
- Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
- Hierarchical isometry properties of hierarchical measurements
- Robust grouped variable selection using distributionally robust optimization
- Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm
- An efficient denoising framework using weighted overlapping group sparsity
- Discrete optimization methods for group model selection in compressed sensing
- Structured sparsity promoting functions
- Degrees of freedom in submodular regularization: a computational perspective of Stein's unbiased risk estimate
- On integer and MPCC representability of affine sparsity
- Investigating consumers' store-choice behavior via hierarchical variable selection
- Optimization problems involving group sparsity terms
- Sparse conditional copula models for structured output regression
- Learning with optimal interpolation norms
- Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO
- Robust multi-image processing with optimal sparse regularization
- New convergence results for the inexact variable metric forward-backward method
- Feature selection with SVD entropy: some modification and extension
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- Low complexity regularization of linear inverse problems
- A smoothing stochastic gradient method for composite optimization
- Oracle inequalities for local and global empirical risk minimizers
- Structured sparsity: discrete and convex approaches
- A lasso for hierarchical interactions
- Grouping strategies and thresholding for high dimensional linear models
- More power via graph-structured tests for differential expression of gene networks
- Smoothing proximal gradient method for general structured sparse regression
- Sparsity constrained estimation in image processing and computer vision
- Proximal methods for the latent group lasso penalty
- A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications
- Supersparse linear integer models for optimized medical scoring systems
- Overlapping group lasso for high-dimensional generalized linear models
- Sparse structure selection and estimation
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Convex optimization for group feature selection in networked data
- High dimensional forecasting via interpretable vector autoregression
- Dependent relevance determination for smooth and structured sparse regression
- Binarsity: a penalization for one-hot encoded features in linear supervised learning
- A single-phase, proximal path-following framework
- Information criteria for variable selection under sparsity
- Structured sparsity through convex optimization
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Estimation of banded time-varying precision matrix based on SCAD and group Lasso
- Tail inverse regression: dimension reduction for prediction of extremes
- Locally Sparse Function-on-Function Regression
- Back-propagating errors through artificial neural networks for variable selection
- Feature grouping and sparse principal component analysis with truncated regularization
- Structured learning in time-dependent Cox models
- Doubly structured sparsity for grouped multivariate responses with application to functional outcome score modeling
- A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity
- Locally sparse estimation for functional linear models with scalar response
- Multi-Task Learning for Gaussian Graphical Regressions with High Dimensional Covariates
- Optimization over a probability simplex
- Optimality conditions for non-negative group sparse constrained optimization problems
- Robust \(\ell_{2,0}\)-penalized rank regression for high-dimensional group selection
- Nonparametric linear feature learning in regression through regularisation
- Tree-guided group lasso for multi-response regression with structured sparsity, with an application to eQTL mapping
- Convex relaxations of penalties for sparse correlated variables with bounded total variation
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)
