2008 SparseInvarianceCovarianceEstimation

Revision as of 00:10, 13 January 2021 by Gmelli (talk | contribs) (Text replacement - "* ... " to "* … ")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Subject Headings: Sparse Learning.

Quotes

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 (~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.,


 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2008 SparseInvarianceCovarianceEstimationJerome H. Friedman
Trevor Hastie
Sparse Inverse Covariance Estimation with the Graphical Lassohttp://arxiv.org/pdf/0708.351710.1093/biostatistics/kxm045