Efficient Latent Variable Graphical Model Selection via Split Bregman Method

Details Efficient Latent Variable Graphical Model Selection via Split Bregman Method Efficient Latent Variable Graphical Model Selection via Split Bregman Method

2011-10-13

arxiv.org/abs/1110.3076v1

Statistics

Machine Learning

Scientific paper

We consider the problem of covariance matrix estimation in the presence of latent variables. Under suitable conditions, it is possible to learn the marginal covariance matrix of the observed variables via a tractable convex program, where the concentration matrix of the observed variables is decomposed into a sparse matrix (representing the graphical structure of the observed variables) and a low rank matrix (representing the marginalization effect of latent variables). We present an efficient first-order method based on split Bregman to solve the convex problem. The algorithm is guaranteed to converge under mild conditions. We show that our algorithm is significantly faster than the state-of-the-art algorithm on both artificial and real-world data. Applying the algorithm to a gene expression data involving thousands of genes, we show that most of the correlation between observed variables can be explained by only a few dozen latent factors.

Affiliated with

Also associated with

No associations

Rating

Efficient Latent Variable Graphical Model Selection via Split Bregman Method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Latent Variable Graphical Model Selection via Split Bregman Method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Latent Variable Graphical Model Selection via Split Bregman Method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521583