The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Scaled sparse linear regression
Open accessAbstract
Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual square and scaling the penalty in proportion to the estimated noise level. The iterative algorithm costs little beyond the computation of a path or grid of the sparse regression estimator for penalty levels above a proper threshold. For the scaled lasso, the algorithm is a gradient descent in a convex minimization of a penalized joint loss function for the regression coefficients and noise level. Under mild regularity conditions, we prove that the scaled lasso simultaneously yields an estimator for the noise level and an estimated coefficient vector satisfying certain oracle inequalities for prediction, the estimation of the noise level and the regression coefficients. These inequalities provide sufficient conditions for the consistency and asymptotic normality of the noise-level estimator, including certain cases where the number of variables is of greater order than the sample size. Parallel results are provided for least-squares estimation after model selection by the scaled lasso. Numerical results demonstrate the superior performance of the proposed methods over an earlier proposal of joint convex minimization.
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
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
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
Self-citationSure 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
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
Simultaneous 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
Meinshausen, N., & Bühlmann, P. (2010) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00740.x · Cited by 2,215
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
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
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
A new approach to variable selection in least squares problems
Osborne, M. (2000) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/20.3.389 · Cited by 859
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2006) · Cited by 744
Osborne, M. R., Presnell, B., & Turlach, B. A. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474883 · Cited by 696
On the conditions used to prove oracle results for the Lasso
van de Geer, S. A., & Bühlmann, P. (2009) · Electronic Journal of Statistics · doi:10.1214/09-ejs506 · Cited by 684
Adaptive Lasso for sparse high-dimensional regression models
Huang, J., Ma, S., & Zhang, C. H. (2008) · Statistica Sinica · Cited by 681
Self-citationSquare-root lasso: pivotal recovery of sparse signals via conic programming
Belloni, A., Chernozhukov, V., & Wang, L. (2011) · Biometrika · doi:10.1093/biomet/asr043 · Cited by 635
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V., Lounici, K., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/11-aos894 · Cited by 598
The sparsity and bias of the Lasso selection in high-dimensional linear regression
Zhang, C.-H., & Huang, J. (2008) · The Annals of Statistics · doi:10.1214/07-aos520 · Cited by 506
Self-citationLasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos582 · Cited by 489
SparseNet: Coordinate Descent With Nonconvex Penalties
Mazumder, R., Friedman, J. H., & Hastie, T. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.tm09738 · Cited by 449
High-dimensional generalized linear models and the lasso
van de Geer, S. A. (2008) · The Annals of Statistics · doi:10.1214/009053607000000929 · Cited by 414
Sparsity oracle inequalities for the Lasso
Bunea, F., Tsybakov, A. B., & Wegkamp, M. H. (2007) · HAL · Cited by 389
Persistence 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
Outlier Detection Using Nonconvex Penalized Regression
She, Y., & Owen, A. B. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.tm10390 · Cited by 310
Regulation of gene expression in the mammalian eye and its relevance to eye disease
Scheetz, T. E., Kim, K.-Y. A., Swiderski, R. E., Philp, A. R., Braun, T. A., Knudtson, K. L., Dorrance, A. M., DiBona, G. F., Huang, J., Casavant, T. L., et al. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0602562103 · Cited by 291
Variance Estimation Using Refitted Cross-Validation in Ultrahigh Dimensional Regression
Fan, J., Guo, S., & Hao, N. (2012) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.01005.x · Cited by 259
Sparsity oracle inequalities for the Lasso
Bunea, F., Tsybakov, A., & Wegkamp, M. (2007) · Electronic Journal of Statistics · doi:10.1214/07-ejs008 · Cited by 253
Rate Minimaxity of the Lasso and Dantzig Selector for the l q Loss in l r Balls
Ye, F., & Zhang, C. (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953043 · Cited by 225
Self-citationSome sharp performance bounds for least squares regression with L1 regularizationPreprint
Zhang, T. (2009) · Cited by 209
Some sharp performance bounds for least squares regression with L1 regularization
Zhang, T. (2009) · The Annals of Statistics · doi:10.1214/08-aos659 · Cited by 200
ℓ1-penalization for mixture regression models
Städler, N., Bühlmann, P., & van de Geer, S. (2010) · TEST · doi:10.1007/s11749-010-0197-z · Cited by 200
ℓ1-Penalization for Mixture Regression ModelsPreprint
van de Geer, S. (2016) · Cited by 178
Discussion of "Least Angle Regression" by Efron, Hastie, Johnstone and Tibshirani
Turlach, B. A. (2004) · UWA Profiles and Research Repository (University of Western Australia) · Cited by 153
Greenshtein, E. (2006) · Cited by 80
PENALIZED LINEAR UNBIASED SELECTION
Zhang, C. (2007) · Cited by 56
Self-citation
Cited by
Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models
Zhang, C.-H., & Zhang, S. S. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12026 · Cited by 993
Self-citationOn asymptotically optimal confidence regions and tests for high-dimensional models
van de Geer, S., Bühlmann, P., Ritov, Y., & Dezeure, R. (2014) · The Annals of Statistics · doi:10.1214/14-aos1221 · Cited by 822
Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
Javanmard, A., & Andrea Montanari, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.3171 · Cited by 635
A significance test for the lasso
Lockhart, R., Taylor, J., Tibshirani, R. J., & Tibshirani, R. (2014) · The Annals of Statistics · doi:10.1214/13-aos1175 · Cited by 541
A general theory of hypothesis tests and confidence regions for sparse high dimensional models
Ning, Y., & Liu, H. (2017) · The Annals of Statistics · doi:10.1214/16-aos1448 · Cited by 281
Metadata
- Authors
- Sun, T., & Zhang, C.-H.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-09-25
- Volume
- 99
- Issue
- 4
- Pages
- 879-898
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W2154972590
- Cited by
- 444
- References
- 36
- FWCI
- 30.26
- 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.