The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
New Insights and Faster Computations for the Graphical Lasso
Abstract
We consider the graphical lasso formulation for estimating a Gaussian graphical model in the high-dimensional setting. This approach entails estimating the inverse covariance matrix under a multivariate normal model by maximizing the ℓ1-penalized log-likelihood. We present a very simple necessary and sufficient condition that can be used to identify the connected components in the graphical lasso solution. The condition can be employed to determine whether the estimated inverse covariance matrix will be block diagonal, and if so, then to identify the blocks. This in turn can lead to drastic speed improvements, since one can simply apply a standard graphical lasso algorithm to each block separately. Moreover, the necessary and sufficient condition provides insight into the graphical lasso solution: the set of connected nodes at any given tuning parameter value is a superset of the set of connected nodes at any larger tuning parameter value. This article has supplementary material online.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
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
Self-citationHigh 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 · cited 6×
“In the timing comparisons reported by Friedman, Hastie, and Tibshirani (2007), the Meinshausen and Bühlmann (2006) approximation is substantially faster than the exact solution to the graphical lasso problem (1.2); however, those timing results were performed without the speed-ups to the graphical…”
MethodInfluentialModel selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627 · cited 3×
“Yuan and Lin (2007) proposed that rather than maximizing the log-likelihood (1.1), one should instead maximize the penalized log-likelihood over nonnegative definite matrices (cid”
BackgroundMethodInfluentialBanerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2007) · arXiv (Cornell University) · doi:10.1145/1390681.1390696 · Cited by 1,233
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
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
Exact covariance thresholding into connected components for large-scale Graphical LassoPreprint
Mazumder, R., & Hastie, T. J. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.3829 · Cited by 132
Smooth Optimization Approach for Sparse Covariance Selection
Lu, Z. (2009) · SIAM Journal on Optimization · doi:10.1137/070695915 · Cited by 105
Efficient Computation of ℓ1Regularized Estimates in Gaussian Graphical Models
Yuan, M. (2008) · Journal of Computational and Graphical Statistics · doi:10.1198/106186008x382692 · Cited by 39
Cited by
The Gaussian Graphical Model in Cross-Sectional and Time-Series Data
Epskamp, S., Waldorp, L. J., Mõttus, R., & Borsboom, D. (2018) · Multivariate Behavioral Research · doi:10.1080/00273171.2018.1454823 · Cited by 1,134
The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
Danaher, P., Wang, P., & Witten, D. M. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12033 · Cited by 855
Self-citationStrong Rules for Discarding Predictors in Lasso-Type Problems
Tibshirani, R., Bien, J., Friedman, J., Hastie, T., Simon, N., Taylor, J., & Tibshirani, R. J. (2012) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.01004.x · Cited by 653
Self-citationThe huge Package for High-dimensional Undirected Graph Estimation in R
Zhao, T., Liu, H., Roeder, K., Lafferty, J., & Wasserman, L. (2020) · PubMed · doi:10.48550/arxiv.2006.14781 · Cited by 465
Closed-Loop and Activity-Guided Optogenetic Control
Grosenick, L., Marshel, J. H., & Deisseroth, K. (2015) · Neuron · doi:10.1016/j.neuron.2015.03.034 · Cited by 380
Metadata
- Authors
- Witten, D. M., Friedman, J. H., & Simon, N.
- Venue
- Journal of Computational and Graphical Statistics
- Publisher
- Informa UK Limited
- Published
- 2011-01
- Volume
- 20
- Issue
- 4
- Pages
- 892-900
- ISSN
- 1061-8600 (ISSN-L)
- 1537-2715
- OpenAlex
- W2074360197
- Cited by
- 325
- References
- 13
- FWCI
- 13.91
- Type
- journal article
- Language
- en
- Open access
- closed
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.