Title
Alternating direction methods for latent variable gaussian graphical model selection.
Abstract
Chandrasekaran, Parrilo, and Willsky (2012) proposed a convex optimization problem for 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 letter, we propose two alternating direction methods for solving this problem. The first method is to apply the classic 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 take advantage of the special structure of the problem and thus can solve large problems very efficiently. A 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 1 million variables in 1 to 2 minutes and are usually 5 to 35 times faster than a state-of-the-art Newton-CG proximal point algorithm.
Year
DOI
Venue
2013
10.1162/NECO_a_00379
Neural Computation
Keywords
Field
DocType
alternating direction method,convex optimization problem,model selection,direction method,proximal gradient-based alternating-direction method,inverse covariance matrix,sample data,gene expression data,low-rank matrix,large problem,consensus problem,latent variable gaussian graphical
Convergence (routing),Mathematical optimization,Matrix (mathematics),Proximal Gradient Methods,Synthetic data,Artificial intelligence,Graphical model,Optimization problem,Convex optimization,Machine learning,Mathematics,Sparse matrix
Journal
Volume
Issue
ISSN
25
8
1530-888X
Citations 
PageRank 
References 
25
1.16
24
Authors
3
Name
Order
Citations
PageRank
Shiqian Ma1106863.48
Lingzhou Xue2314.33
Hui Zou31218.79