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.

References in zbMATH (referenced in 257 articles , 1 standard article )

Showing results 1 to 20 of 257.
Sorted by year (citations)

1 2 3 ... 11 12 13 next

  1. Banerjee, Sayantan; Akbani, Rehan; Baladandayuthapani, Veerabhadran: Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer (2019)
  2. Bollhöfer, Matthias; Eftekhari, Aryan; Scheidegger, Simon; Schenk, Olaf: Large-scale sparse inverse covariance matrix estimation (2019)
  3. De Wiel, Mark A. van; Te Beest, Dennis E.; Münch, Magnus M.: Learning from a lot: empirical Bayes for high-dimensional model-based prediction (2019)
  4. Kundu, Suprateek; Mallick, Bani K.; Baladandayuthapani, Veera: Efficient Bayesian regularization for graphical model selection (2019)
  5. Mehta, Ronak; Kim, Hyunwoo J.; Wang, Shulei; Johnson, Sterling C.; Yuan, Ming; Singh, Vikas: Localizing differentially evolving covariance structures via scan statistics (2019)
  6. Neuberg, Richard; Glasserman, Paul: Estimating a covariance matrix for market risk management and the case of credit default swaps (2019)
  7. Neykov, Matey; Lu, Junwei; Liu, Han: Combinatorial inference for graphical models (2019)
  8. Pauger, Daniela; Wagner, Helga: Bayesian effect fusion for categorical predictors (2019)
  9. Pun, Chi Seng; Wong, Hoi Ying: A linear programming model for selection of sparse high-dimensional multiperiod portfolios (2019)
  10. Sanguinetti, Guido (ed.); Huynh-Thu, Vân Anh (ed.): Gene regulatory networks. Methods and protocols (2019)
  11. Yue, Mu; Li, Jialiang; Cheng, Ming-Yen: Two-step sparse boosting for high-dimensional longitudinal data with varying coefficients (2019)
  12. Ziwen An, Leah F. South, Christopher C. Drovand: BSL: An R Package for Efficient Parameter Estimation for Simulation-Based Models via Bayesian Synthetic Likelihood (2019) arXiv
  13. Avanesov, Valeriy; Buzun, Nazar: Change-point detection in high-dimensional covariance structure (2018)
  14. Ayyıldız, Ezgi; Purutçuoğlu, Vilda; Weber, Gerhard Wilhelm: Loop-based conic multivariate adaptive regression splines is a novel method for advanced construction of complex biological networks (2018)
  15. Azose, Jonathan J.; Raftery, Adrian E.: Estimating large correlation matrices for international migration (2018)
  16. Barber, Rina Foygel; Kolar, Mladen: ROCKET: robust confidence intervals via Kendall’s tau for transelliptical graphical models (2018)
  17. Bilgrau, Anders Ellern; Brøndum, Rasmus Froberg; Eriksen, Poul Svante; Dybkær, Karen; Bøgsted, Martin: Estimating a common covariance matrix for network meta-analysis of gene expression datasets in diffuse large B-cell lymphoma (2018)
  18. Castelletti, Federico; Consonni, Guido; Della Vedova, Marco L.; Peluso, Stefano: Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach (2018)
  19. Champion, Magali; Picheny, Victor; Vignes, Matthieu: Inferring large graphs using (\ell_1)-penalized likelihood (2018)
  20. Chang, Jinyuan; Qiu, Yumou; Yao, Qiwei; Zou, Tao: Confidence regions for entries of a large precision matrix (2018)

1 2 3 ... 11 12 13 next