The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
A unified approach to model selection and sparse recovery using regularized least squares
Open accessAbstract
Model selection and sparse recovery are two important problems for which many regularization methods have been proposed. We study the properties of regularization methods in both problems under the unified framework of regularized least squares with concave penalties. For model selection, we establish conditions under which a regularized least squares estimator enjoys a nonasymptotic property, called the weak oracle property, where the dimensionality can grow exponentially with sample size. For sparse recovery, we present a sufficient condition that ensures the recoverability of the sparsest solution. In particular, we approach both problems by considering a family of penalties that give a smooth homotopy between L0 and L1 penalties. We also propose the sequentially and iteratively reweighted squares (SIRS) algorithm for sparse recovery. Numerical studies support our theoretical results and demonstrate the advantage of our new methods for model selection and sparse recovery.
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
Variable 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
Ideal spatial adaptation by wavelet shrinkage
Donoho, D. L., & Johnstone, I. M. (1994) · Biometrika · doi:10.1093/biomet/81.3.425 · Cited by 8,760
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 7×
“Hunter and Li (2005) propose and study MM algorithms for variable selection. Li and Liang (2008) study variable selection for semiparametric regression models.”
BackgroundMethodInfluentialDecoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Atomic 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
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
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
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Sure Independence Screening for Ultrahigh Dimensional Feature Space
Fan, J., & Lv, J. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00674.x · Cited by 2,711
Self-citationSimultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
A Statistical View of Some Chemometrics Regression Tools
Frank, L. E., & Friedman, J. H. (1993) · Technometrics · doi:10.1080/00401706.1993.10485033 · Cited by 2,213
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Better Subset Regression Using the Nonnegative Garrote
Breiman, L. (1995) · Technometrics · doi:10.1080/00401706.1995.10484371 · Cited by 1,043
Nonconcave penalized likelihood with a diverging number of parameters
Fan, J., & Peng, H. (2004) · The Annals of Statistics · doi:10.1214/009053604000000256 · Cited by 1,002
Tuning parameter selectors for the smoothly clipped absolute deviation method
Wang, H., Li, R., & Tsai, C.-L. (2007) · Biometrika · doi:10.1093/biomet/asm053 · Cited by 768
One-step sparse estimates in nonconcave penalized likelihood models
Zou, H., & Li, R. (2008) · The Annals of Statistics · doi:10.1214/009053607000000802 · Cited by 683
Regularization of Wavelet Approximations
Antoniadis, A., & Fan, J. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753208942 · Cited by 498
High-dimensional classification using features annealed independence rules
Fan, J., & Fan, Y. (2008) · The Annals of Statistics · doi:10.1214/07-aos504 · Cited by 480
Self-citationPersistence in high-dimensional linear predictor selection and the virtue of overparametrization
Greenshtein, E., & Ritov, Y. (2004) · Bernoulli · doi:10.3150/bj/1106314846 · Cited by 362
Statistical challenges with high dimensionality: feature selection in knowledge discovery
Fan, J., & Li, R. (2007) · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · doi:10.4171/022-3/31 · Cited by 348
Variable selection using MM algorithms
Hunter, D. R., & Li, R. (2005) · The Annals of Statistics · doi:10.1214/009053605000000200 · Cited by 338
Variable selection in semiparametric regression modeling
Li, R., & Liang, H. (2008) · The Annals of Statistics · doi:10.1214/009053607000000604 · Cited by 296
Local Strong Homogeneity of a Regularized Estimator
Nikolova, M. (2000) · SIAM Journal on Applied Mathematics · doi:10.1137/s0036139997327794 · Cited by 291
Bickel, P. J., Li, B., Tsybakov, A. B., van de Geer, S. A., Yu, B., Valdés, T., Rivero, C., Fan, J., & van der Vaart, A. (2006) · Test · doi:10.1007/bf02607055 · Cited by 223
DASSO: Connections Between the Dantzig Selector and Lasso
James, G. M., Radchenko, P., & Lv, J. (2009) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00668.x · Cited by 171
Self-citationDiscussion: A tale of three cousins: Lasso, L2Boosting and Dantzig
Meinshausen, N., Rocha, G., & Yu, B. (2007) · The Annals of Statistics · doi:10.1214/009053607000000460 · Cited by 72
Cited by
A framework for feature selection in clustering
Witten, D. M., & Tibshirani, R. (2010) · Journal of the American Statistical Association · doi:10.1198/jasa.2010.tm09415 · Cited by 696
“Other penalties on w could be used that would also yield sparsity (see, e.g., Fan and Li 2001; Lv and Fan 2009).”
BackgroundBest 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
Minimization of $\ell_{1-2}$ for Compressed Sensing
Yin, P., Lou, Y., He, Q., & Xin, J. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140952363 · Cited by 473
Nonconcave Penalized Likelihood With NP-Dimensionality
Fan, J., & Lv, J. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158486 · Cited by 427
Self-citationRobust rank correlation based screening
Li, G., Peng, H., Zhang, J., & Zhu, L. (2012) · The Annals of Statistics · doi:10.1214/12-aos1024 · Cited by 307
Metadata
- Authors
- Lv, J., & Fan, Y.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2009-12-01
- Volume
- 37
- Issue
- 6A
- Pages
- 3498-3528
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2101083207
- Cited by
- 252
- References
- 30
- FWCI
- 8.47
- Type
- journal article
- Language
- en
- Open access
- bronze
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.