glasso
The graphical lasso: new insights and alternatives. The graphical lasso [5] 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 [2, 11]. The R package glasso [5] is popular, fast, and allows one to efficiently build a path of models for different values of the tuning parameter. Convergence of glasso 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 glasso. By studying the “normal equations” we see that, glasso is solving the dual of the graphical lasso penalized likelihood, by block coordinate ascent; a result which can also be found in [2]. In this dual, the target of estimation is Σ, the covariance matrix, rather than the precision matrix Θ. We propose similar primal algorithms p-glasso and dp-glasso, 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 dp-glasso is superior from several points of view.
Keywords for this software
References in zbMATH (referenced in 175 articles , 1 standard article )
Showing results 1 to 20 of 175.
Sorted by year (- Champion, Magali; Picheny, Victor; Vignes, Matthieu: Inferring large graphs using $\ell_1$-penalized likelihood (2018)
- Karl Sjöstrand; Line Clemmensen; Rasmus Larsen; Gudmundur Einarsson; Bjarne Ersbøll: SpaSM: A MATLAB Toolbox for Sparse Statistical Modeling (2018)
- Loh, Po-Ling; Tan, Xin Lu: High-dimensional robust precision matrix estimation: cellwise corruption under $\epsilon $-contamination (2018)
- Perrot-Dockès, Marie; Lévy-Leduc, Céline; Sansonnet, Laure; Chiquet, Julien: Variable selection in multivariate linear models with high-dimensional covariance matrix estimation (2018)
- Popovic, Gordana C.; Hui, Francis K. C.; Warton, David I.: A general algorithm for covariance modeling of discrete data (2018)
- Torri, Gabriele; Giacometti, Rosella; Paterlini, Sandra: Robust and sparse banking network estimation (2018)
- Aste, Tomaso; Di Matteo, T.: Sparse causality network retrieval from short time series (2017)
- Boutsidis, Christos; Drineas, Petros; Kambadur, Prabhanjan; Kontopoulou, Eugenia-Maria; Zouzias, Anastasios: A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix (2017)
- Cheng, Lulu; Shan, Liang; Kim, Inyoung: Multilevel Gaussian graphical model for multilevel networks (2017)
- Hirose, Kei; Fujisawa, Hironori; Sese, Jun: Robust sparse Gaussian graphical modeling (2017)
- Janková, Jana; Van de Geer, Sara: Honest confidence regions and optimality in high-dimensional precision matrix estimation (2017)
- Jonatan Kallus, Jose Sanchez, Alexandra Jauhiainen, Sven Nelander, Rebecka Jornsten: ROPE: high-dimensional network modeling with robust control of edge FDR (2017) arXiv
- Kühnel, Line; Sommer, Stefan; Pai, Akshay; Raket, Lars Lau: Most likely separation of intensity and warping effects in image registration (2017)
- Kwon, Sunghoon; Ahn, Jeongyoun; Jang, Woncheol; Lee, Sangin; Kim, Yongdai: A doubly sparse approach for group variable selection (2017)
- Leppä-aho, Janne; Pensar, Johan; Roos, Teemu; Corander, Jukka: Learning Gaussian graphical models with fractional marginal pseudo-likelihood (2017)
- Li, Fan-qun; Zhang, Xin-sheng: Bayesian Lasso with neighborhood regression method for Gaussian graphical model (2017)
- Lin, Jiahe; Michailidis, George: Regularized estimation and testing for high-dimensional multi-block vector-autoregressive models (2017)
- Lu, Zhaosong: Randomized block proximal damped Newton method for composite self-concordant minimization (2017)
- Nanty, Simon; Helbert, Céline; Marrel, Amandine; Pérot, Nadia; Prieur, Clémentine: Uncertainty quantification for functional dependent random variables (2017)
- Park, Young Woong; Klabjan, Diego: Bayesian network learning via topological order (2017)