The Graphical Lasso: New Insights and Alternatives

11/23/2011
by   Rahul Mazumder, et al.
0

The graphical lasso FHT2007a is an algorithm for learning the structure in an undirected Gaussian graphical model, using ℓ_1 regularization to control the number of zeros in the precision matrix Θ=Σ^-1 BGA2008,yuan_lin_07. The R package FHT2007a is popular, fast, and allows one to efficiently build a path of models for different values of the tuning parameter. Convergence of can be tricky; the converged precision matrix might not be the inverse of the estimated covariance, and occasionally it fails to converge with warm starts. In this paper we explain this behavior, and propose new algorithms that appear to outperform . By studying the "normal equations" we see that, is solving the dual of the graphical lasso penalized likelihood, by block coordinate ascent; a result which can also be found in BGA2008. In this dual, the target of estimation is Σ, the covariance matrix, rather than the precision matrix Θ. We propose similar primal algorithms and , that also operate by block-coordinate descent, where Θ is the optimization target. We study all of these algorithms, and in particular different approaches to solving their coordinate sub-problems. We conclude that is superior from several points of view.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2012

Two New Algorithms for Solving Covariance Graphical Lasso Based on Coordinate Descent and ECM

Covariance graphical lasso applies a lasso penalty on the elements of th...
research
01/06/2021

Graphical Elastic Net and Target Matrices: Fast Algorithms and Software for Sparse Precision Matrix Estimation

We consider estimation of undirected Gaussian graphical models and inver...
research
05/11/2023

Two new algorithms for maximum likelihood estimation of sparse covariance matrices with applications to graphical modeling

In this paper, we propose two new algorithms for maximum-likelihood esti...
research
07/22/2020

Fused-Lasso Regularized Cholesky Factors of Large Nonstationary Covariance Matrices of Longitudinal Data

Smoothness of the subdiagonals of the Cholesky factor of large covarianc...
research
10/25/2011

A Flexible, Scalable and Efficient Algorithmic Framework for Primal Graphical Lasso

We propose a scalable, efficient and statistically motivated computation...
research
03/04/2022

Improved Pathwise Coordinate Descent for Power Penalties

Pathwise coordinate descent algorithms have been used to compute entire ...
research
03/10/2021

A Bayesian Graphical Approach for Large-Scale Portfolio Management with Fewer Historical Data

Managing a large-scale portfolio with many assets is one of the most cha...

Please sign up or login with your details

Forgot password? Click here to reset