The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
First-Order Methods for Sparse Covariance Selection
Open accessAbstract
Given a sample covariance matrix, we solve a maximum likelihood problem penalized by the number of nonzero coefficients in the inverse covariance matrix. Our objective is to find a sparse representation of the sample data and to highlight conditional independence relationships between the sample variables. We first formulate a convex relaxation of this combinatorial problem, we then detail two efficient first-order algorithms with low memory requirements to solve large-scale, dense problem instances.
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
Multimodel Inference: Understanding AIC and BIC in Model Selection
Burnham, K. P., & Anderson, D. R. (2004) · Sociological Methods & Research · doi:10.1177/0049124104268644 · Cited by 11,648
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Dempster, A. P. (1972) · Biometrics · doi:10.2307/2528966 · Cited by 905
Sparse nonnegative solution of underdetermined linear equations by linear programming
Donoho, D. L., & Tanner, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0502269102 · Cited by 577
On the convergence of the coordinate descent method for convex differentiable minimization
Luo, Z. Q., & Tseng, P. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00939948 · Cited by 502
Sparse graphical models for exploring gene expression data
Dobra, A., Hans, C., Jones, B., Nevins, J. R., Yao, G., & West, M. (2004) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2004.02.009 · Cited by 462
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
Cited by
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
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
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
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence
Ravikumar, P., Wainwright, M. J., Raskutti, G., & Yu, B. (2011) · Electronic Journal of Statistics · doi:10.1214/11-ejs631 · Cited by 744
Phase recovery, MaxCut and complex semidefinite programming
Waldspurger, I., d’Aspremont, A., & Mallat, S. (2015) · Mathematical Programming · doi:10.1007/s10107-013-0738-9 · Cited by 573
Self-citationSparse 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
Generalized Thresholding of Large Covariance Matrices
Rothman, A. J., Levina, E., & Zhu, J. (2009) · Journal of the American Statistical Association · doi:10.1198/jasa.2009.0101 · Cited by 489
Joint estimation of multiple graphical models
Guo, J., Levina, E., Michailidis, G., & Zhu, J. (2011) · Biometrika · doi:10.1093/biomet/asq060 · Cited by 431
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
“These rst-order methods were further studied in, for example, [1, 39, 27, 10, 40, 50, 29], and successfully used in sparse covariance selection, rank reduction in multivariate linear regression and compressed sensing etc. (see, for example, [ 11 , 25, 26, 4]).”
MethodSparsistency 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
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
Sparse Multivariate Regression With Covariance Estimation
Rothman, A. J., Levina, E., & Zhu, J. (2010) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2010.09188 · Cited by 350
New Insights and Faster Computations for the Graphical Lasso
Witten, D. M., Friedman, J. H., & Simon, N. (2011) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2011.11051a · Cited by 325
Robust and sparse correlation matrix estimation for the analysis of high-dimensional genomics data
Serra, A., Coretto, P., Fratello, M., & Tagliaferri, R. (2018) · Bioinformatics · doi:10.1093/bioinformatics/btx642 · Cited by 25
Metadata
- Authors
- d'Aspremont, A., Banerjee, O., & El Ghaoui, L.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2008-01
- Volume
- 30
- Issue
- 1
- Pages
- 56-66
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2044600950
- Cited by
- 343
- References
- 12
- FWCI
- 23.59
- Type
- journal article
- Language
- en
- Open access
- green
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.