Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
From MaRDI portal
Publication:5378251
Abstract: Chandrasekaran, Parrilo and Willsky (2010) proposed a convex optimization problem to characterize graphical model selection in the presence of unobserved variables. This convex optimization problem aims to estimate an inverse covariance matrix that can be decomposed into a sparse matrix minus a low-rank matrix from sample data. Solving this convex optimization problem is very challenging, especially for large problems. In this paper, we propose two alternating direction methods for solving this problem. The first method is to apply the classical alternating direction method of multipliers to solve the problem as a consensus problem. The second method is a proximal gradient based alternating direction method of multipliers. Our methods exploit and take advantage of the special structure of the problem and thus can solve large problems very efficiently. Global convergence result is established for the proposed methods. Numerical results on both synthetic data and gene expression data show that our methods usually solve problems with one million variables in one to two minutes, and are usually five to thirty five times faster than a state-of-the-art Newton-CG proximal point algorithm.
Recommendations
- Latent variable graphical model selection via convex optimization
- Alternating direction method for covariance selection models
- Graphical model selection with latent variables
- Graphical model selection for Gaussian conditional random fields in the presence of latent variables
- Sparse Gaussian graphical model estimation via alternating minimization
- Rejoinder: Latent variable graphical model selection via convex optimization
- Model selection and estimation in the Gaussian graphical model
- Discussion: Latent variable graphical model selection via convex optimization
- Discussion: Latent variable graphical model selection via convex optimization
- Discussion: Latent variable graphical model selection via convex optimization
Cites work
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3894797 (Why is no real title available?)
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A new inexact alternating directions method for monotone variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating direction method for covariance selection models
- Alternating proximal gradient method for convex minimization
- An alternating direction method for total variation denoising
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimating time-varying networks
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Fast multiple-splitting algorithms for convex optimization
- First-Order Methods for Sparse Covariance Selection
- Hankel matrix rank minimization with applications to system identification and realization
- High dimensional inverse covariance matrix estimation via linear programming
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- High-dimensional graphs and variable selection with the Lasso
- High-dimensional semiparametric Gaussian copula graphical models
- Introduction to Graphical Modelling
- Latent variable graphical model selection via convex optimization
- Model selection and estimation in the Gaussian graphical model
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Partial correlation estimation by joint sparse regression models
- Positive-definite \(\ell_1\)-penalized estimation of large covariance matrices
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Regularization methods for semidefinite programming
- Regularized rank-based estimation of high-dimensional nonparanormal graphical models
- Signal Recovery by Proximal Forward-Backward Splitting
- Smooth Optimization Approach for Sparse Covariance Selection
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- Sparse inverse covariance estimation with the graphical lasso
- Sparse permutation invariant covariance estimation
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The Split Bregman Method for L1-Regularized Problems
Cited in
(30)- Graphical model selection with latent variables
- Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter
- Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
- Rejoinder: Latent variable graphical model selection via convex optimization
- Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity
- An implementable first-order primal-dual algorithm for structured convex optimization
- High-dimensional covariance matrix estimation
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- Detection of block-exchangeable structure in large-scale correlation matrices
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint
- Alternating direction based method for optimal control problem constrained by Stokes equation
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints
- Robust Subspace Discovery via Relaxed Rank Minimization
- scientific article; zbMATH DE number 7370576 (Why is no real title available?)
- Estimating finite mixtures of ordinal graphical models
- Estimation of graphical models: an overview of selected topics
- Alternating direction method for covariance selection models
- Characterizing brain connectivity from human electrocorticography recordings with unobserved inputs during epileptic seizures
- Robust Causal Structure Learning with Some Hidden Variables
- Nonparametric Finite Mixture of Gaussian Graphical Models
- Alternating proximal gradient method for convex minimization
- Graphical model selection for Gaussian conditional random fields in the presence of latent variables
- Latent variable graphical model selection via convex optimization
- Diagonally Dominant Principal Component Analysis
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- On the penalized maximum likelihood estimation of high-dimensional approximate factor model
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Sensitivity analysis of the proximal-based parallel decomposition methods
- Estimation of graphical models through structured norm minimization
This page was built for publication: Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378251)
