Fetching the paper…
Reading the bibliography…
Concave regularization methods provide natural procedures for sparse recovery.
Information theory and an extension of the maximum likelihood principle
H. Akaike · 1973
Earlier work this paper cites.
Some comments on cp
C. Mallows · 1973
Earlier work this paper cites.
Estimating the dimension of a model
G. Schwarz · 1978
Earlier work this paper cites.
A statistical view of some chemometrics regression tools (with discussion)
I. Frank and J. Friedman · 1993
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Asymptotics for lasso-type estimators
K. Knight and W. Fu · 2000
Earlier work this paper cites.
A new approach to variable selection in least squares problems
M. Osborne, B. Presnell, and B. Turlach · 2000
Earlier work this paper cites.
On the lasso and its dual
M. Osborne, B. Presnell, and B. Turlach · 2000
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. S. Chen, D. L. Donoho, and M. A. Saunders · 2001
Earlier work this paper cites.
Local operator theory, random matrices and Banach spaces
K. Davidson and S. Szarek · 2001
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
J. Fan and R. Li · 2001
Earlier work this paper cites.
Least angle regression (with discussion)
B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani · 2004
Earlier work this paper cites.
On non-concave penalized likelihood with diverging number of parameters
J. Fan and H. Peng · 2004
Earlier work this paper cites.
Persistence in high–dimensional linear predictor selection and the virtue of overparametrization
E. Greenshtein and Y. Rotiv · 2004
Earlier work this paper cites.
Decoding by linear programming
E. J. Candes and T. Tao · 2005
Earlier work this paper cites.
Variable selection using MM algorithms
D. Hunter and R. Li · 2005
Earlier work this paper cites.
High dimensional graphs and variable selection with the Lasso
N. Meinshausen and P. Bühlmann · 2006
Earlier work this paper cites.
Just relax: convex programming methods for identifying sparse signals in noise
J. A. Tropp · 2006
Cited alongside, same era.
On model selection consistency of Lasso
P. Zhao and B. Yu · 2006
Cited alongside, same era.
The adaptive Lasso and its oracle properties
H. Zou · 2006
Cited alongside, same era.
Sparsity oracle inequalities for the lasso
F. Bunea, A. Tsybakov, and M. Wegkamp · 2007
Cited alongside, same era.
The Dantzig selector: statistical estimation when p p is much larger than n n (with discussion)
E. Candes and T. Tao · 2007
Cited alongside, same era.
The deterministic Lasso
S. van de Geer · 2007
Cited alongside, same era.
Sharp thresholds for noisy and high–dimensional recovery of sparsity using ℓ 1 \ell_{1} –constrained quadratic programming (Lasso)
M. J. Wainwright · 2009
Later among the works it cites.
Some sharp performance bounds for least squares regression with l 1 l_{1} regularization
T. Zhang · 2009
Later among the works it cites.
Comments on: ℓ 1 \ell_{1} -penalization for mixture regression models
A. Antoniadis · 2010
Later among the works it cites.
Shifting inequality and recovery of sparse signals
T. Cai, L. Wang, and G. Xu · 2010
Later among the works it cites.
Multi-stage Dantzig selector
J. Liu, P. Wonka, and J. Ye · 2010
Later among the works it cites.
ℓ 1 \ell_{1} -penalization for mixture regression models (with discussion)
N. Städler, P. Bühlmann, and S. van de Geer · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Huang, S. Ma, and C.-H. Zhang · 2008
Cited alongside, same era.
Smoothly clipped absolute deviation on high dimensions
Y. Kim, H. Choi, and H.-S. Oh · 2008
Cited alongside, same era.
High–dimensional generalized linear models and the Lasso
S. van de Geer · 2008
Cited alongside, same era.
The sparsity and bias of the Lasso selection in high–dimensional linear regression
C.-H. Zhang and J. Huang · 2008
Cited alongside, same era.
One-step sparse estimates in nonconcave penalized likelihood models (with discussion)
H. Zou and R. Li · 2008
Cited alongside, same era.
Simultaneous analysis of Lasso and Dantzig selector
P. Bickel, Y. Ritov, and A. Tsybakov · 2009
Cited alongside, same era.
Later among the works it cites.
Comments on: ℓ 1 \ell_{1} -penalization for mixture regression models
T. Sun and C.-H. Zhang · 2010
Later among the works it cites.
Rate minimaxity of the lasso and dantzig selector for the ℓ q \ell_{q} loss in ℓ r \ell_{r} balls
F. Ye and C.-H. Zhang · 2010
Later among the works it cites.
Nearly unbiased variable selection under minimax concave penalty
C.-H. Zhang · 2010
Later among the works it cites.
Analysis of multi-stage convex relaxation for sparse regularization
T. Zhang · 2010
Later among the works it cites.
Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
P. Breheny and J. Huang · 2011
Closest in time.
Statistics for High-Dimensional Data: Methods, Theory and Applications
P. Bühlmann and S. van de Geer · 2011
Closest in time.
Sparsenet : Coordinate descent with non-convex penalties
R. Mazumder, J. Friedman, and T. Hastie · 2011
Closest in time.
Scaled sparse linear regression
T. Sun and C.-H. Zhang · 2011
Closest in time.
Adaptive forward-backward greedy algorithm for learning sparse representations
T. Zhang · 2011
Closest in time.
Multi-stage convex relaxation for feature selection
T. Zhang · 2011
Closest in time.