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 422 articles , 1 standard article )
Showing results 1 to 20 of 422.
Sorted by year (- Barceló, Pablo; Baumgartner, Alexander; Dalmau, Victor; Kimelfeld, Benny: Regularizing conjunctive features for classification (2021)
- Burkina, M.; Nazarov, I.; Panov, M.; Fedonin, G.; Shirokikh, B.: Inductive matrix completion with feature selection (2021)
- Byrd, Michael; Nghiem, Linh H.; McGee, Monnie: Bayesian regularization of Gaussian graphical models with measurement error (2021)
- Fan, Xinyan; Zhang, Qingzhao; Ma, Shuangge; Fang, Kuangnan: Conditional score matching for high-dimensional partial graphical models (2021)
- Ha, Min Jin; Stingo, Francesco Claudio; Baladandayuthapani, Veerabhadran: Bayesian structure learning in multilayered genomic networks (2021)
- Huling, Jared D.; Smith, Maureen A.; Chen, Guanhua: A two-part framework for estimating individualized treatment rules from semicontinuous outcomes (2021)
- Kashlak, Adam B.: Non-asymptotic error controlled sparse high dimensional precision matrix estimation (2021)
- Kereta, Željko; Klock, Timo: Estimating covariance and precision matrices along subspaces (2021)
- Lapucci, Matteo; Levato, Tommaso; Sciandrone, Marco: Convergent inexact penalty decomposition methods for cardinality-constrained problems (2021)
- Lukemire, Joshua; Kundu, Suprateek; Pagnoni, Giuseppe; Guo, Ying: Bayesian joint modeling of multiple brain functional networks (2021)
- Ma, Cong; Lu, Junwei; Liu, Han: Inter-subject analysis: a partial Gaussian graphical model approach (2021)
- Musolas, Antoni; Smith, Steven T.; Marzouk, Youssef: Geodesically parameterized covariance estimation (2021)
- Park, Gunwoong; Kim, Yesool: Learning high-dimensional Gaussian linear structural equation models with heterogeneous error variances (2021)
- Phan, Dzung T.; Menickelly, Matt: On the solution of (\ell_0)-constrained sparse inverse covariance estimation problems (2021)
- Pun, Chi Seng; Hadimaja, Matthew Zakharia: A self-calibrated direct approach to precision matrix estimation and linear discriminant analysis in high dimensions (2021)
- Wang, Y. X. Rachel; Li, Lexin; Li, Jingyi Jessica; Huang, Haiyan: Network modeling in biology: statistical methods for gene and brain networks (2021)
- Yang, Xinming; Gan, Lingrui; Narisetty, Naveen N.; Liang, Feng: GemBag: group estimation of multiple Bayesian graphical models (2021)
- Zhang, Ning; Zhang, Yangjing; Sun, Defeng; Toh, Kim-Chuan: An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems (2021)
- Zhang, Qingzhao; Ma, Shuangge; Huang, Yuan: Promote sign consistency in the joint estimation of precision matrices (2021)
- Andrade, Daniel; Takeda, Akiko; Fukumizu, Kenji: Robust Bayesian model selection for variable clustering with the Gaussian graphical model (2020)