Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration

Details Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration

2010-12-05

arxiv.org/abs/1012.0975v2

Statistics

Machine Learning

Scientific paper

We consider the problem of estimating the inverse covariance matrix by maximizing the likelihood function with a penalty added to encourage the sparsity of the resulting matrix. We propose a new approach based on the split Bregman method to solve the regularized maximum likelihood estimation problem. We show that our method is significantly faster than the widely used graphical lasso method, which is based on blockwise coordinate descent, on both artificial and real-world data. More importantly, different from the graphical lasso, the split Bregman based method is much more general, and can be applied to a class of regularization terms other than the $\ell_1$ norm

Affiliated with

Also associated with

No associations

Rating

Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration 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 Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-517359