Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block \ell _{1}/\ell _{\infty} -Regularization
From MaRDI portal
Publication:5273638
Cited in
(16)- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- A no-free-lunch theorem for multitask learning
- Variable selection and collinearity processing for multivariate data via row-elastic-net regularization
- Discrete optimization methods for group model selection in compressed sensing
- Structured estimation for the nonparametric Cox model
- Low complexity regularization of linear inverse problems
- L₁-regularized least squares for support recovery of high dimensional single index models with Gaussian designs
- On Degrees of Freedom of Projection Estimators With Applications to Multivariate Nonparametric Regression
- Modeling association between multivariate correlated outcomes and high-dimensional sparse covariates: the adaptive SVS method
- Structured sparsity through convex optimization
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Block-diagonal precision matrix regularization for ultra-high dimensional data
- Non-convex penalized multitask regression using data depth-based penalties
- Convex support vector regression
- Detecting clusters in multivariate response regression
- Estimation of the error structure in multivariate response linear regression models
This page was built for publication: Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block $\ell _{1}/\ell _{\infty} $-Regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273638)
