Sparse estimation of large covariance matrices via a nested Lasso penalty

Details Sparse estimation of large covariance matrices via a nested Lasso penalty Sparse estimation of large covariance matrices via a nested Lasso penalty

2008-03-27

arxiv.org/abs/0803.3872v1

Annals of Applied Statistics 2008, Vol. 2, No. 1, 245-263

Statistics

Applications

Published in at http://dx.doi.org/10.1214/07-AOAS139 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Ins

Scientific paper

10.1214/07-AOAS139

The paper proposes a new covariance estimator for large covariance matrices when the variables have a natural ordering. Using the Cholesky decomposition of the inverse, we impose a banded structure on the Cholesky factor, and select the bandwidth adaptively for each row of the Cholesky factor, using a novel penalty we call nested Lasso. This structure has more flexibility than regular banding, but, unlike regular Lasso applied to the entries of the Cholesky factor, results in a sparse estimator for the inverse of the covariance matrix. An iterative algorithm for solving the optimization problem is developed. The estimator is compared to a number of other covariance estimators and is shown to do best, both in simulations and on a real data example. Simulations show that the margin by which the estimator outperforms its competitors tends to increase with dimension.

Affiliated with

Also associated with

No associations

Rating

Sparse estimation of large covariance matrices via a nested Lasso penalty 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 Sparse estimation of large covariance matrices via a nested Lasso penalty, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse estimation of large covariance matrices via a nested Lasso penalty will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353719