REVIEW 2 cited by
Graphical Elastic Net and Target Matrices: Fast Algorithms and Software for Sparse Precision Matrix Estimation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We consider estimation of undirected Gaussian graphical models and inverse covariances in high-dimensional scenarios by penalizing the corresponding precision matrix. While single $L_1$ (Graphical Lasso) and $L_2$ (Graphical Ridge) penalties for the precision matrix have already been studied, we propose the combination of both, yielding an Elastic Net type penalty. We enable additional flexibility by allowing to include diagonal target matrices for the precision matrix. We generalize existing algorithms for the Graphical Lasso and provide corresponding software with an efficient implementation to facilitate usage for practitioners. Our software borrows computationally favorable parts from a number of existing packages for the Graphical Lasso, leading to an overall fast(er) implementation and at the same time yielding also much more methodological flexibility.
Forward citations
Cited by 2 Pith papers
-
High-dimensional Statistics Applications to Batch Effects in Metabolomics
A new QC-based simultaneous test (QC-ST) and a covariance correction method (CoCo) are proposed to evaluate and reduce batch effects in metabolomics.
-
Entropy Adjusted Graphical Lasso for Sparse Precision Matrix Estimation
The proposed EAGL estimator adds a log-determinant penalty that duplicates the likelihood's own log-det term, making it equivalent to a scaled Graphical Lasso.
Discussion (0). Continue with ORCID to comment.