The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Sparse inverse covariance estimation with the graphical lasso
Open accessAbstract
We consider the problem of estimating sparse graphs by a lasso penalty applied to the inverse covariance matrix. Using a coordinate descent procedure for the lasso, we develop a simple algorithm—the graphical lasso—that is remarkably fast: It solves a 1000-node problem (∼500000 parameters) in at most a minute and is 30–4000 times faster than competing methods. It also provides a conceptual link between the exact problem and the approximation suggested by Meinshausen and Bühlmann (2006). We illustrate the method on some cell-signaling data from proteomics.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“These methods have the advantage to be able to recover the off diagonal structure of the covariance matrix.”
From Signal Estimation and Uncertainties Extraction in Terahertz Time-Domain Spectroscopy (2025) · cites this paper as [59]
In the citing paper
“In [59], they proposed the graphical lasso, a fast algorithm based on coordinate descent approach to solve this problem.”
From Signal Estimation and Uncertainties Extraction in Terahertz Time-Domain Spectroscopy (2025) · cites this paper as [59]
In the citing paper
“L1-norm regularisation of the inverse covariance matrix [55] shrinks the estimated values in the partial correlation matrix, so that very small, noisy values are forced to zero, and all other values are better estimated.”
From Functional connectomics from resting-state fMRI (2013) · cites this paper as [55]
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Pathwise coordinate optimization
Friedman, J., Hastie, T., Höfling, H., & Tibshirani, R. (2007) · The Annals of Applied Statistics · doi:10.1214/07-aoas131 · Cited by 1,895
Self-citationCausal Protein-Signaling Networks Derived from Multiparameter Single-Cell Data
Sachs, K., Perez, O., Pe'er, D., Lauffenburger, D. A., & Nolan, G. P. (2005) · Science · doi:10.1126/science.1105809 · Cited by 1,708
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
Coordinate descent algorithms for lasso penalized regressionPreprint
Wu, T. T., & Lange, K. L. (2008) · Cited by 740
Determinant Maximization with Linear Matrix Inequality Constraints
Vandenberghe, L., Boyd, S., & Wu, S.-P. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896303430 · Cited by 652
Covariance selection for nonchordal graphs via chordal embedding
Dahl, J., Vandenberghe, L., & Roychowdhury, V. (2008) · Optimization methods & software · doi:10.1080/10556780802102693 · Cited by 122
Model Selection Through Sparse Maximum Likelihood EstimationPreprint
Banerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0704 · Cited by 119
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Tracking whole-brain connectivity dynamics in the resting state
Allen, E. A., Damaraju, E., Plis, S. M., Erhardt, E. B., Eichele, T., & Calhoun, V. D. (2014) · Cerebral Cortex · doi:10.1093/cercor/bhs352 · Cited by 2,992
A tutorial on regularized partial correlation networks
Epskamp, S., & Fried, E. I. (2018) · Psychological Methods · doi:10.1037/met0000167 · Cited by 2,918
Network modelling methods for FMRI
Smith, S. M., Miller, K. L., Salimi-Khorshidi, G., Webster, M., Beckmann, C. F., Nichols, T. E., Ramsey, J. D., & Woolrich, M. W. (2011) · NeuroImage · doi:10.1016/j.neuroimage.2010.08.063 · Cited by 1,878
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
Metadata
- Authors
- Friedman, J., Hastie, T., & Tibshirani, R.
- Affiliations
- Stanford University (US)
- Corresponding author
- Tibshirani, Robert
- Venue
- Biostatistics
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-12-12
- Volume
- 9
- Issue
- 3
- Pages
- 432-441
- ISSN
- 1465-4644 (ISSN-L)
- 1468-4357
- PMC
- PMC3019769
- OpenAlex
- W2132555912
- Semantic Scholar
- 05ab43b91321e8cf57a42614dd630baecd110bd0
- Cited by
- 6,355
- References
- 10
- Citations by year
- 2026: 427 · 2025: 554 · 2024: 499 · 2023: 446 · 2022: 476 · 2021: 568 · 2020: 498 · 2019: 507 · 2018: 411 · 2017: 365 · 2016: 338 · 2015: 284 · 2014: 288 · 2013: 218 · 2012: 194
- FWCI
- 51.14
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Biostatistics (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- Funders
- National Institutes of Health (n01hv28183-13-0-0)
- National Heart, Lung, and Blood Institute (N01-HV-28 183)
- National Cancer Institute (R01CA072028, 2R01 CA 72028-07)
- National Institute of Biomedical Imaging and Bioengineering (R01EB001988)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene expression and cancer classification
- Keywords
- sparse inverse covariance estimation, graphical lasso, sparse graphs, lasso penalty, coordinate descent, high-dimensional covariance estimation, gene regulatory network inference, signal transduction, proteomics
- MeSH terms
- Algorithms, Animals, Biometry, Data Interpretation, Statistical, Humans, Reference Values, Regression Analysis, Time Factors, Models, Statistical, Signal Transduction, Neural Networks, Computer, Sample Size, Proteomics
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sparse inverse covariance estimation with the graphical lasso. https://app.cochat.ai/papers/10.1093/biostatistics/kxm045
- The paper
- Friedman, J., Hastie, T., & Tibshirani, R. (2008). Sparse inverse covariance estimation with the graphical lasso. Biostatistics. https://doi.org/10.1093/biostatistics/kxm045
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.