MuSP: a multistep screening procedure for sparse recovery
type: Item
instance of: scholarly article
title: MuSP: a multistep screening procedure for sparse recovery
author: Yuehan Yang
author: Ji Zhu
author: Edward I. George
published in: Stat
publication date: 2024-05-21T00:00:00Z
Mathematics Subject Classification ID: 62-XX
zbMATH DE Number: 7851292
zbMATH Keywords: high-dimensional data
zbMATH Keywords: iterative algorithm
zbMATH Keywords: Lasso
zbMATH Keywords: multistep method
MaRDI profile type: MaRDI publication profile
cites work: Least squares after model selection in high-dimensional sparse models
cites work: Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
cites work: Discussion: One-step sparse estimates in nonconcave penalized likelihood models
cites work: Statistics for high-dimensional data. Methods, theory and applications.
cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
cites work: Near-ideal model selection by \(\ell _{1}\) minimization
cites work: Least angle regression. (With discussion)
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
cites work: Nonconcave penalized likelihood with a diverging number of parameters.
cites work: Strong oracle optimality of folded concave penalized estimation
cites work: Q5251797
cites work: Q3543468
cites work: Estimation And Selection Via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications
cites work: Global solutions to folded concave penalized nonconvex learning
cites work: High-dimensional graphs and variable selection with the Lasso
cites work: Lasso-type recovery of sparse representations for high-dimensional data
cites work: Restricted eigenvalue properties for correlated Gaussian designs
cites work: The Spike-and-Slab LASSO
cites work: Q4864293
cites work: The Lasso problem and uniqueness
cites work: Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
cites work: Calibrating nonconvex penalized regression in ultra-high dimension
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: The sparsity and bias of the LASSO selection in high-dimensional linear regression
cites work: A general theory of concave regularization for high-dimensional sparse estimation problems
cites work: Analysis of multi-stage convex relaxation for sparse regularization
cites work: Q3174050
cites work: The Adaptive Lasso and Its Oracle Properties
cites work: One-step sparse estimates in nonconcave penalized likelihood models
DOI: 10.1002/STA4.352
description: scientific article; zbMATH DE number 7851292