2013
DOI: 10.1162/neco_a_00379
|View full text |Cite
|
Sign up to set email alerts
|

Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection

Abstract: 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 probl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
71
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 72 publications
(71 citation statements)
references
References 62 publications
0
71
0
Order By: Relevance
“…Assuming that the gene expression levels follow a multivariate normal distribution, the conditional independence can be recovered by estimating the support of the inverse covariance matrix of the expression data. One approach is to estimate the inverse covariance matrix directly using penalized maximum likelihood approaches [Cai, Liu and Luo (2011), Cai, Liu and Zhou (2012), Friedman, Hastie and Tibshirani (2008), Ma, Xue and Zou (2013)]. Alternatively, the neighborhood selection method is based on sparse regression techniques to select the pairs of genes with nonzero partial correlations.…”
Section: Background and Datamentioning
confidence: 99%
“…Assuming that the gene expression levels follow a multivariate normal distribution, the conditional independence can be recovered by estimating the support of the inverse covariance matrix of the expression data. One approach is to estimate the inverse covariance matrix directly using penalized maximum likelihood approaches [Cai, Liu and Luo (2011), Cai, Liu and Zhou (2012), Friedman, Hastie and Tibshirani (2008), Ma, Xue and Zou (2013)]. Alternatively, the neighborhood selection method is based on sparse regression techniques to select the pairs of genes with nonzero partial correlations.…”
Section: Background and Datamentioning
confidence: 99%
“…ADMM (1.6) has been revisited recently due to its success in the emerging applications of structured convex optimization problems arising from image processing, compressed sensing, machine learning, semidefinite programming and statistics etc. (see e.g., [5,27,29,30,32,34,47,54,56,58,60,62,64,66,70,71,73,75,78]). …”
Section: Alternating Direction Methods Of Multipliersmentioning
confidence: 99%
“…Especially, its special case of m = 2, which is the well-known alternating direction method of multipliers (ADMM) contributed in [22,23], received a revived interest and is widely used in the areas of variational inequalities [32], signal/image processing [8,10,24], statistical learning [5,13,36,41,52,54], etc. Compared with the well-developed ADMM, however, the most recent work of Chen et al [12] shows that the direct extension (1.2) of ADMM for m ≥ 3 is not necessarily convergent.…”
Section: Augmented-lagrangian-based Splitting Methodsmentioning
confidence: 99%