Sparsistency and rates of convergence in large covariance matrix estimation

Details Sparsistency and rates of convergence in large covariance matrix estimation Sparsistency and rates of convergence in large covariance matrix estimation

2007-11-26

arxiv.org/abs/0711.3933v3

Annals of Statistics 2009, Vol. 37, No. 6B, 4254-4278

Mathematics

Statistics Theory

Published in at http://dx.doi.org/10.1214/09-AOS720 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of

Scientific paper

10.1214/09-AOS720

This paper studies the sparsistency and rates of convergence for estimating sparse covariance and precision matrices based on penalized likelihood with nonconvex penalty functions. Here, sparsistency refers to the property that all parameters that are zero are actually estimated as zero with probability tending to one. Depending on the case of applications, sparsity priori may occur on the covariance matrix, its inverse or its Cholesky decomposition. We study these three sparsity exploration problems under a unified framework with a general penalty function. We show that the rates of convergence for these problems under the Frobenius norm are of order $(s_n\log p_n/n)^{1/2}$, where $s_n$ is the number of nonzero elements, $p_n$ is the size of the covariance matrix and $n$ is the sample size. This explicitly spells out the contribution of high-dimensionality is merely of a logarithmic factor. The conditions on the rate with which the tuning parameter $\lambda_n$ goes to 0 have been made explicit and compared under different penalties. As a result, for the $L_1$-penalty, to guarantee the sparsistency and optimal rate of convergence, the number of nonzero elements should be small: $s_n'=O(p_n)$ at most, among $O(p_n^2)$ parameters, for estimating sparse covariance or correlation matrix, sparse precision or inverse correlation matrix or sparse Cholesky factor, where $s_n'$ is the number of the nonzero elements on the off-diagonal entries. On the other hand, using the SCAD or hard-thresholding penalty functions, there is no such a restriction.

Affiliated with

Also associated with

No associations

Rating

Sparsistency and rates of convergence in large covariance matrix estimation 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 Sparsistency and rates of convergence in large covariance matrix estimation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparsistency and rates of convergence in large covariance matrix estimation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170324