Sparse Gaussian graphical model estimation via alternating minimization
From MaRDI portal
Abstract: Several methods have been recently proposed for estimating sparse Gaussian graphical models using regularization on the inverse covariance matrix. Despite recent advances, contemporary applications require methods that are even faster in order to handle ill-conditioned high dimensional modern day datasets. In this paper, we propose a new method, G-AMA, to solve the sparse inverse covariance estimation problem using Alternating Minimization Algorithm (AMA), that effectively works as a proximal gradient algorithm on the dual problem. Our approach has several novel advantages over existing methods. First, we demonstrate that G-AMA is faster than the previous best algorithms by many orders of magnitude and is thus an ideal approach for modern high throughput applications. Second, global linear convergence of G-AMA is demonstrated rigorously, underscoring its good theoretical properties. Third, the dual algorithm operates on the covariance matrix, and thus easily facilitates incorporating additional constraints on pairwise/marginal relationships between feature pairs based on domain specific knowledge. Over and above estimating a sparse inverse covariance matrix, we also illustrate how to (1) incorporate constraints on the (bivariate) correlations and, (2) incorporate equality (equisparsity) or linear constraints between individual inverse covariance elements. Fourth, we also show that G-AMA is better adept at handling extremely ill-conditioned problems, as is often the case with real data. The methodology is demonstrated on both simulated and real datasets to illustrate its superior performance over recently proposed methods.
Recommendations
- QUIC: quadratic approximation for sparse inverse covariance estimation
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- Sparse inverse covariance estimation with the graphical lasso
- High-dimensional covariance estimation based on Gaussian graphical models
- Large-scale sparse inverse covariance matrix estimation
Cited in
(17)- Inferring sparse Gaussian graphical models with latent structure
- An efficient ADMM algorithm for high dimensional precision matrix estimation via penalized quadratic loss
- Multivariate sparse Laplacian shrinkage for joint estimation of two graphical structures
- De-noising analysis of noisy data under mixed graphical models
- Robust sparse Gaussian graphical modeling
- QUIC: quadratic approximation for sparse inverse covariance estimation
- Joint estimation of sparse multivariate regression and conditional graphical models
- Sparse Matrix Graphical Models
- Sparse Gaussian graphical mixture model
- Learning unfaithful K-separable Gaussian graphical models
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- On the non-local priors for sparsity selection in high-dimensional Gaussian DAG models
- Sparse nonparametric graphical models
- Analysis of noisy survival data with graphical proportional hazards measurement error models
- pISTA: preconditioned Iterative Soft Thresholding Algorithm for Graphical Lasso
- Estimation of graphical models: an overview of selected topics
- A self-calibrated direct approach to precision matrix estimation and linear discriminant analysis in high dimensions
This page was built for publication: Sparse Gaussian graphical model estimation via alternating minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384477)
