Sparse inverse covariance estimation with the graphical lasso - PubMed (original) (raw)

Sparse inverse covariance estimation with the graphical lasso

Jerome Friedman et al. Biostatistics. 2008 Jul.

Abstract

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 ( approximately 500,000 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.

PubMed Disclaimer

Figures

Fig. 1.

Fig. 1.

Number of CPU seconds required for the graphical lasso procedure.

Fig. 2.

Fig. 2.

Directed acylic graph from cell-signaling data, from Sachs and others (2003).

Fig. 3.

Fig. 3.

Cell-signaling data: Undirected graphs from graphical lasso with different values of the penalty parameter ρ.

Fig. 4.

Fig. 4.

Cell-signaling data: Profile of coefficients as the total_L_1norm of the coefficient vector increases, that is as_ρ_decreases. Profiles for the largest coefficients are labeled with the corresponding pair of proteins.

Fig. 5.

Fig. 5.

Cell-signaling data. Left panel shows 10-fold cross-validation using both regression and likelihood approaches (details in text). Right panel compares the regression sum of squares of the exact graphical lasso approach to the Meinhausen–Buhlmann approximation.

Similar articles

Cited by

References

    1. Banerjee O, Ghaoui LE, d'Aspremont A. Model selection through sparse maximum likelihood estimation. Journal of Machine Learning Research. 2007 101 (to appear)
    1. Boyd S, Vandenberghe L. Convex Optimization. Cambridge: Cambridge University Press; 2004.
    1. Dahl J, Vandenberghe L, Roychowdhury V. Covariance selection for non-chordal graphs via chordal embedding. Optimization Methods and Software (to appear) 2007
    1. Friedman J, Hastie T, Hoefling H, Tibshirani R. Pathwise coordinate optimization. Annals of Applied Statistics. 2007;2
    1. Meinshausen N, Bühlmann P. High dimensional graphs and variable selection with the lasso. Annals of Statistics. 2006;34:1436–1462.

Publication types

MeSH terms

Grants and funding

LinkOut - more resources