The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
SparseNet: Coordinate Descent With Nonconvex Penalties
Open accessAbstract
We address the problem of sparse selection in linear models. A number of nonconvex penalties have been proposed in the literature for this purpose, along with a variety of convex-relaxation algorithms for finding good solutions. In this article we pursue a coordinate-descent approach for optimization, and study its convergence properties. We characterize the properties of penalties suitable for this approach, study their corresponding threshold functions, and describe a df-standardizing reparametrization that assists our pathwise algorithm. The MC+ penalty is ideally suited to this task, and we use it to demonstrate the performance of our algorithm. Certain technical derivations and experiments related to this article are included in the Supplementary Materials section.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Self-citationVariable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470 · cited 6×
“MLLA does perfect variable selection and shows good predictive accuracy. depends heavily on the initial (Zou and Li 2008) in The adaptive LASSO of Zou (2006) is very similar in spirit to this formulation, though the weights (depending upon a good initial estimator) are allowed to be more general…”
BackgroundMethodResultInfluentialAtomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Nearly unbiased variable selection under minimax concave penalty
Zhang, C.-H. (2010) · The Annals of Statistics · doi:10.1214/09-aos729 · Cited by 3,835
Estimation of the Mean of a Multivariate Normal Distribution
Stein, C. M. (1981) · The Annals of Statistics · doi:10.1214/aos/1176345632 · Cited by 2,729
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521
Cited by
Regression Shrinkage and Selection via The Lasso: A Retrospective
Tibshirani, R. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.00771.x · Cited by 3,589
Wright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Best subset selection via a modern optimization lens
Bertsimas, D., King, A., & Mazumder, R. (2016) · The Annals of Statistics · doi:10.1214/15-aos1388 · Cited by 655
Self-citationMoving Object Detection by Detecting Contiguous Outliers in the Low-Rank Representation
Zhou, X., Yang, C., & Yu, W. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.132 · Cited by 648
Scaled sparse linear regression
Sun, T., & Zhang, C.-H. (2012) · Biometrika · doi:10.1093/biomet/ass043 · Cited by 444
A Generalized Iterated Shrinkage Algorithm for Non-convex Sparse Coding
Zuo, W., Meng, D., Zhang, L., Feng, X., & Zhang, D. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.34 · Cited by 396
Ročková, V., & George, E. I. (2018) · Journal of the American Statistical Association · doi:10.1080/01621459.2016.1260469 · Cited by 341
Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
Wang, L., Wu, Y., & Li, R. (2012) · Journal of the American Statistical Association · doi:10.1080/01621459.2012.656014 · Cited by 323
Strong oracle optimality of folded concave penalized estimation
Fan, J., Xue, L., & Zou, H. (2014) · The Annals of Statistics · doi:10.1214/13-aos1198 · Cited by 313
A Selective Review of Group Selection in High-Dimensional Models
Huang, J., Breheny, P., & Ma, S. (2012) · Statistical Science · doi:10.1214/12-sts392 · Cited by 300
A General Theory of Concave Regularization for High-Dimensional Sparse Estimation Problems
Zhang, C.-H., & Zhang, T. (2012) · Statistical Science · doi:10.1214/12-sts399 · Cited by 296
Rodosthenous, T., Shahrezaei, V., & Evangelou, M. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa530 · Cited by 67
Metadata
- Authors
- Mazumder, R., Friedman, J. H., & Hastie, T.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 2011-09
- Volume
- 106
- Issue
- 495
- Pages
- 1125-1138
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W1965169081
- Cited by
- 449
- References
- 32
- FWCI
- 34.22
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.