Sparse inverse covariance estimation with the lasso

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 that is remarkably fast: in the worst cases, it solves a 1000 node problem (~500,000 parameters) in about a minute, and is 50 to 2000 times faster than competing methods. It also provides a conceptual link between the exact problem and the approximation suggested by Meinhausen and Buhlmann (2006). We illustrate the method on some cell-signaling data from proteomics.

submitted

References in corpus (2)

• Pathwise coordinate optimization
• Model Selection Through Sparse Maximum Likelihood Estimation

Cited by in corpus (12)

• Regularized estimation of large-scale gene association networks using graphical Gaussian models
• On Graphical Models via Univariate Exponential Family Distributions
• Decomposable Principal Component Analysis
• Covariance estimation in decomposable Gaussian graphical models
• A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
• Optimizing regularized Cholesky score for order-based learning of Bayesian networks
• Direct Learning of Sparse Changes in Markov Networks by Density Ratio Estimation
• StackVAE-G: An efficient and interpretable model for time series anomaly detection
• Identifying Small Mean Reverting Portfolios
• Graph selection with GGMselect
• GSA-Forecaster: Forecasting Graph-Based Time-Dependent Data with Graph Sequence Attention
• A Log-Linear Graphical Model for Inferring Genetic Networks from High-Throughput Sequencing Data