The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Sparsistency and rates of convergence in large covariance matrix estimation
Open accessAbstract
This paper studies the sparsistency and rates of convergence for estimating sparse covariance and precision matrices based on penalized likelihood with nonconvex penalty functions. Here, sparsistency refers to the property that all parameters that are zero are actually estimated as zero with probability tending to one. Depending on the case of applications, sparsity priori may occur on the covariance matrix, its inverse or its Cholesky decomposition. We study these three sparsity exploration problems under a unified framework with a general penalty function. We show that the rates of convergence for these problems under the Frobenius norm are of order (s(n) log p(n)/n)(1/2), where s(n) is the number of nonzero elements, p(n) is the size of the covariance matrix and n is the sample size. This explicitly spells out the contribution of high-dimensionality is merely of a logarithmic factor. The conditions on the rate with which the tuning parameter λ(n) goes to 0 have been made explicit and compared under different penalties. As a result, for the L(1)-penalty, to guarantee the sparsistency and optimal rate of convergence, the number of nonzero elements should be small: sn'=O(pn) at most, among O(pn2) parameters, for estimating sparse covariance or correlation matrix, sparse precision or inverse correlation matrix or sparse Cholesky factor, where sn' is the number of the nonzero elements on the off-diagonal entries. On the other hand, using the SCAD or hard-thresholding penalty functions, there is no such a restriction.
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
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
Self-citationThe 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×
“However, it is not clear whether it is applicable to the specific case of covariance matrix estimation. In particular, they did not link the dimensionality pn with the number of nonzero elements sn in the true covariance matrix 0, or the precision matrix 0. A direct application of their results to our setting can only…”
MethodInfluentialSparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
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 1×
“f interest on the estimation of sparse covariance matrix or precision matrix using penalized likelihood method. [13] used the LASSO on the off- diagonal elements of the Cholesky factor from MCD, while [15], [4] and [23] use different LASSO algorithms to select sparse elements in the precision matrix. A novel penalty cal…”
MethodThe Group Lasso for Logistic Regression
Meier, L., Van De Geer, S., & Bühlmann, P. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00627.x · Cited by 1,674
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
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
Self-citationRegularized estimation of large covariance matrices
Bickel, P. J., & Levina, E. (2008) · The Annals of Statistics · doi:10.1214/009053607000000758 · Cited by 934
Dempster, A. P. (1972) · Biometrics · doi:10.2307/2528966 · Cited by 905
Covariance regularization by thresholding
Bickel, P. J., & Levina, E. (2008) · The Annals of Statistics · doi:10.1214/08-aos600 · Cited by 893
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
Joint mean-covariance models with applications to longitudinal data: unconstrained parameterisation
Pourahmadi, M. (1999) · Biometrika · doi:10.1093/biomet/86.3.677 · Cited by 598
Sparse permutation invariant covariance estimation
Rothman, A. J., Bickel, P. J., Levina, E., & Zhu, J. (2008) · Electronic Journal of Statistics · doi:10.1214/08-ejs176 · Cited by 560
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
Optimal Rates of Convergence for Covariance Matrix Estimation
Cai, T., Zhang, C.-H., Zhou, H. H., et al. (2008) · Cited by 456
Covariance matrix selection and estimation via penalised normal likelihood
Huang, J. Z., Liu, N., Pourahmadi, M., & Liu, L. (2006) · Biometrika · doi:10.1093/biomet/93.1.85 · Cited by 407
Network exploration via the adaptive LASSO and SCAD penalties
Fan, J., Feng, Y., & Wu, Y. (2009) · The Annals of Applied Statistics · doi:10.1214/08-aoas215 · Cited by 397
Self-citationFirst-Order Methods for Sparse Covariance Selection
d'Aspremont, A., Banerjee, O., & El Ghaoui, L. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060670985 · Cited by 343
Nonparametric estimation of large covariance matrices of longitudinal data
Wu, W. B. (2003) · Biometrika · doi:10.1093/biomet/90.4.831 · Cited by 300
Operator norm consistent estimation of large-dimensional sparse covariance matrices
El Karoui, N. (2008) · The Annals of Statistics · doi:10.1214/07-aos559 · Cited by 244
Sparse estimation of large covariance matrices via a nested Lasso penalty
Levina, E., Rothman, A., & Zhu, J. (2008) · The Annals of Applied Statistics · doi:10.1214/07-aoas139 · Cited by 214
Efficient estimation of covariance selection models
Wong, F. (2003) · Biometrika · doi:10.1093/biomet/90.4.809 · Cited by 201
Parsimonious Covariance Matrix Estimation for Longitudinal Data
Smith, M., & Kohn, R. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502388618942 · Cited by 187
Nonparametric Estimation of Covariance Structure in Longitudinal Data
Diggle, P. J., & Verbyla, A. P. (1998) · Biometrics · doi:10.2307/3109751 · Cited by 125
Discovering Sparse Covariance Structures With the Isomap
Wagaman, A. S., & Levina, E. (2009) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.08021 · Cited by 44
Cited by
Sparse and Compositionally Robust Inference of Microbial Ecological Networks
Kurtz, Z. D., Müller, C. L., Miraldi, E. R., Littman, D. R., Blaser, M. J., & Bonneau, R. A. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004226 · Cited by 1,799
“A wealth of theoretical results are available that characterize conditions for asymptotic and finite sample guarantees for the estimated networks [20, 29, 39, 43, 46].”
BackgroundModel selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
A Constrained ℓ1Minimization Approach to Sparse Precision Matrix Estimation
Cai, T., Liu, W., & Luo, X. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.tm10155 · Cited by 973
Large Covariance Estimation by Thresholding Principal Orthogonal Complements
Fan, J., Liao, Y., & Mincheva, M. (2013) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12016 · Cited by 909
Self-citationHigh-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Metadata
- Authors
- Lam, C., & Fan, J.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2009-12-01
- Volume
- 37
- Issue
- 6B
- Pages
- 4254-4278
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W1972276842
- Cited by
- 418
- References
- 25
- FWCI
- 15.30
- 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.