The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence
Open accessAbstract
Given i.i.d. observations of a random vector X∈ℝp, we study the problem of estimating both its covariance matrix Σ*, and its inverse covariance or concentration matrix Θ*=(Σ*)−1. When X is multivariate Gaussian, the non-zero structure of Θ* is specified by the graph of an associated Gaussian Markov random field; and a popular estimator for such sparse Θ* is the ℓ1-regularized Gaussian MLE. This estimator is sensible even for for non-Gaussian X, since it corresponds to minimizing an ℓ1-penalized log-determinant Bregman divergence. We analyze its performance under high-dimensional scaling, in which the number of nodes in the graph p, the number of edges s, and the maximum node degree d, are allowed to grow as a function of the sample size n. In addition to the parameters (p,s,d), our analysis identifies other key quantities that control rates: (a) the ℓ∞-operator norm of the true covariance matrix Σ*; and (b) the ℓ∞ operator norm of the sub-matrix Γ*SS, where S indexes the graph edges, and Γ*=(Θ*)−1⊗(Θ*)−1; and (c) a mutual incoherence or irrepresentability measure on the matrix Γ* and (d) the rate of decay 1/f(n,δ) on the probabilities {|Σ̂nij−Σ*ij|>δ}, where Σ̂n is the sample covariance based on n samples. Our first result establishes consistency of our estimate Θ̂ in the elementwise maximum-norm. This in turn allows us to derive convergence rates in Frobenius and spectral norms, with improvements upon existing results for graphs with maximum node degrees $d=o(\sqrt{s})$. In our second result, we show that with probability converging to one, the estimate Θ̂ correctly specifies the zero pattern of the concentration matrix Θ*. We illustrate our theoretical results via simulations for various graphs and problem parameters, showing good correspondences between the theoretical predictions and behavior in simulations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
A well-conditioned estimator for large-dimensional covariance matrices
Ledoit, O., & Wolf, M. (2004) · Journal of Multivariate Analysis · doi:10.1016/s0047-259x(03)00096-4 · Cited by 3,046
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
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
On the distribution of the largest eigenvalue in principal components analysis
Johnstone, I. M. (2001) · The Annals of Statistics · doi:10.1214/aos/1009210544 · Cited by 1,949
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
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
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
Self-citationRegularized estimation of large covariance matrices
Bickel, P. J., & Levina, E. (2006) · Cited by 1,166
Covariance regularization by thresholding
Bickel, P. J., & Levina, E. (2007) · Cited by 1,118
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
Regularized estimation of large covariance matrices
Bickel, P. J., & Levina, E. (2008) · The Annals of Statistics · doi:10.1214/009053607000000758 · Cited by 934
Covariance regularization by thresholding
Bickel, P. J., & Levina, E. (2008) · The Annals of Statistics · doi:10.1214/08-aos600 · Cited by 893
Parallel optimization: Theory, algorithms, and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90713-1 · Cited by 813
Sparse Permutation Invariant Covariance Estimation
Rothman, A., Bickel, P. J., Levina, E., & Zhu, J. (2007) · Cited by 686
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
Optimal Rates of Convergence for Covariance Matrix Estimation
Cai, T., Zhang, C.-H., Zhou, H. H., et al. (2008) · Cited by 456
Sparsistency and rates of convergence in large covariance matrix estimation
Lam, C., & Fan, J. (2009) · The Annals of Statistics · doi:10.1214/09-aos720 · Cited by 418
Estimation of high-dimensional prior and posterior covariance matrices in Kalman filter variants
Furrer, R., & Bengtsson, T. (2007) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2006.08.003 · Cited by 414
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
Fundamentals of Statistical Exponential Families
Brown, L. D. (1987) · Cited by 386
Operator norm consistent estimation of large-dimensional sparse covariance matricesPreprint
Karoui, N. E. (2012) · Cited by 345
First-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
Optimal rates of convergence for covariance matrix estimation
Cai, T. T., Zhang, C.-H., & Zhou, H. H. (2010) · The Annals of Statistics · doi:10.1214/09-aos752 · Cited by 318
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
Time varying undirected graphs
Zhou, S., Lafferty, J., & Wasserman, L. (2010) · Machine Learning · doi:10.1007/s10994-010-5180-0 · Cited by 195
Sparse Principal Components Analysis
Johnstone, I. M., & Lu, A. Y. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.4392 · Cited by 160
A note on the Lasso for Gaussian graphical model selection
Meinshausen, N. (2007) · Statistics & Probability Letters · doi:10.1016/j.spl.2007.09.014 · Cited by 56
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
Network analysis of multivariate data in psychological science
Borsboom, D., Deserno, M. K., Rhemtulla, M., Epskamp, S., Fried, E. I., McNally, R. J., Robinaugh, D. J., Perugini, M., Dalege, J., Costantini, G., et al. (2021) · Nature Reviews Methods Primers · doi:10.1038/s43586-021-00055-w · Cited by 1,371
A new method for constructing networks from binary data
van Borkulo, C. D., Borsboom, D., Epskamp, S., Blanken, T. F., Boschloo, L., Schoevers, R. A., & Waldorp, L. J. (2014) · Scientific Reports · doi:10.1038/srep05918 · Cited by 757
Latent variable graphical model selection via convex optimization
Chandrasekaran, V., Parrilo, P. A., & Willsky, A. S. (2012) · The Annals of Statistics · doi:10.1214/11-aos949 · Cited by 377
Connecting the Dots: Identifying Network Structure via Graph Signal Processing
Mateos, G., Segarra, S., Marques, A. G., & Ribeiro, A. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2890143 · Cited by 369
Metadata
- Authors
- Ravikumar, P., Wainwright, M. J., Raskutti, G., & Yu, B.
- Venue
- Electronic Journal of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2011-01-01
- Volume
- 5
- Issue
- none
- Pages
- 935-980
- ISSN
- 1935-7524 (ISSN-L)
- OpenAlex
- W2097581234
- Cited by
- 744
- References
- 34
- FWCI
- 48.69
- Type
- journal article
- Language
- en
- Open access
- gold
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.
