The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
A General Theory of Concave Regularization for High-Dimensional Sparse Estimation Problems
Open accessAbstract
Concave regularization methods provide natural procedures for sparse recovery. However, they are difficult to analyze in the high-dimensional setting. Only recently a few sparse recovery results have been established for some specific local solutions obtained via specialized numerical procedures. Still, the fundamental relationship between these solutions such as whether they are identical or their relationship to the global minimizer of the underlying nonconvex formulation is unknown. The current paper fills this conceptual gap by presenting a general theoretical framework showing that, under appropriate conditions, the global solution of nonconvex regularization leads to desirable recovery performance; moreover, under suitable conditions, the global solution corresponds to the unique sparse local solution, which can be obtained via different numerical procedures. Under this unified framework, we present an overview of existing results and discuss their connections. The unified view of this work leads to a more satisfactory treatment of concave high-dimensional sparse estimation procedures, and serves as a guideline for developing further numerical procedures for concave regularization.
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Information Theory and an Extension of the Maximum Likelihood Principle
Akaike, H. (1998) · Springer Series in Statistics · doi:10.1007/978-1-4612-1694-0_15 · Cited by 17,781
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
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470
Decoding 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. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
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-citationHigh-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
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
Mallows, C. L. (1995) · Technometrics · doi:10.1080/00401706.1995.10484370 · Cited by 2,083
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
Statistics for High-Dimensional Data: Methods, Theory and Applications
Bühlmann, P., & van de Geer, S. (2011) · Springer Series in Statistics · doi:10.1007/978-3-642-20192-9 · Cited by 1,680
Statistics for High-Dimensional Data: Methods, Theory and Applications
Bhlmann, P., & van de Geer, S. (2011) · Cited by 1,527
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
Asymptotics for lasso-type estimators
Fu, W., & Knight, K. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957397 · Cited by 1,276
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
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
One-step sparse estimates in nonconcave penalized likelihood modelsPreprint
Zou, H., & Li, R. (2008) · Cited by 919
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
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
Adaptive Lasso for sparse high-dimensional regression models
Huang, J., Ma, S., & Zhang, C. H. (2008) · Statistica Sinica · Cited by 681
Self-citationBreheny, P., & Huang, J. (2011) · The Annals of Applied Statistics · doi:10.1214/10-aoas388 · Cited by 671
Square-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
Analysis of Multi-stage Convex Relaxation for Sparse Regularization
Zhang, T. (2010) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5555/1756006.1756041 · Cited by 597
Self-citationThe 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
Asymptotic properties of bridge estimators in sparse high-dimensional regression models
Huang, J., Horowitz, J. L., & Ma, S. (2008) · The Annals of Statistics · doi:10.1214/009053607000000875 · Cited by 482
Near-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2008) · Cited by 469
Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
Raskutti, G., Wainwright, M. J., & Yu, B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165799 · Cited by 455
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
Mallows, C. L. (1973) · Technometrics · doi:10.1080/00401706.1973.10489103 · Cited by 427
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
Variable selection using MM algorithmsPreprint
Hunter, D. R., & Li, R. (2005) · Cited by 375
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
Variable selection using MM algorithms
Hunter, D. R., & Li, R. (2005) · The Annals of Statistics · doi:10.1214/009053605000000200 · Cited by 338
Near-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2009) · The Annals of Statistics · doi:10.1214/08-aos653 · Cited by 302
Smoothly Clipped Absolute Deviation on High Dimensions
Kim, Y., Choi, H., & Oh, H.-S. (2008) · Journal of the American Statistical Association · doi:10.1198/016214508000001066 · Cited by 261
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
Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
Zhang, T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146690 · Cited by 248
Self-citationSome sharp performance bounds for least squares regression with L1 regularizationPreprint
Zhang, T. (2009) · Cited by 208
Self-citationSome 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
Self-citationℓ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
Multi-stage convex relaxation for feature selection
Zhang, T. (2013) · Bernoulli · doi:10.3150/12-bej452 · Cited by 104
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-citationHigh-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
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
A Simple Method for Estimating Interactions Between a Treatment and a Large Number of Covariates
Tian, L., Alizadeh, A. A., Gentles, A. J., & Tibshirani, R. (2014) · Journal of the American Statistical Association · doi:10.1080/01621459.2014.951443 · Cited by 370
Ročková, V., & George, E. I. (2018) · Journal of the American Statistical Association · doi:10.1080/01621459.2016.1260469 · Cited by 341
Metadata
- Authors
- Zhang, C.-H., & Zhang, T.
- Venue
- Statistical Science
- Publisher
- Institute of Mathematical Statistics
- Published
- 2012-11-01
- Volume
- 27
- Issue
- 4
- Pages
- 576-593
- ISSN
- 0883-4237 (ISSN-L)
- OpenAlex
- W2061598070
- Cited by
- 296
- References
- 52
- FWCI
- 20.67
- 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.