Papers › GGLasso -- a Python package for General Graphical Lasso computation
GGLasso -- a Python package for General Graphical Lasso computation
Fabian Schaipp, Christian L. Müller, Oleg Vlasovets
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce GGLasso, a Python package for solving General Graphical Lasso problems. The Graphical Lasso scheme, introduced by (Friedman 2007) (see also (Yuan 2007; Banerjee 2008)), estimates a sparse inverse covariance matrix Θ from multivariate Gaussian data 𝒳 ∼𝒩(μ, Σ) ∈ℝᵖ. Originally proposed by (Dempster 1972) under the name Covariance Selection, this estimation framework has been extended to include latent variables in (Chandrasekaran 2012). Recent extensions also include the joint estimation of multiple inverse covariance matrices, see, e.g., in (Danaher 2013; Tomasi 2018). The GGLasso package contains methods for solving a general problem formulation, including important special cases, such as, the single (latent variable) Graphical Lasso, the Group, and the Fused Graphical Lasso.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections