The Masked Sample Covariance Estimator: An Analysis via the Matrix Laplace Transform
Abstract
Covariance estimation becomes challenging in the regime where the number p of variables outstrips the number n of samples available to construct the estimate. One way to circumvent this problem is to assume that the covariance matrix is nearly sparse and to focus on estimating only the significant entries. To analyze this approach, Levina and Vershynin (2011) introduce a formalism called masked covariance estimation, where each entry of the sample covariance estimator is reweighed to reflect an a priori assessment of its importance. This paper provides a new analysis of the masked sample covariance estimator based on the matrix Laplace transform method. The main result applies to general subgaussian distributions. Specialized to the case of a Gaussian distribution, the theory offers qualitative improvements over earlier work. For example, the new results show that n = O(B log ^2 p) samples suffice to estimate a banded covariance matrix with bandwidth B up to a relative spectral-norm error, in contrast to the sample complexity n = O(B log ^5 p) obtained by Levina and Vershynin.
Additional Information
Research supported by ONR awards N00014-08-1-0883 and N00014-11-1-0025, DARPA award N66001-08-1-2065, AFOSR award FA9550-09- 1-0643, and a Sloan Fellowship.Attached Files
Accepted Version - Caltech_ACM_TR_2012_01.pdf
Files
Name | Size | Download all |
---|---|---|
md5:482c02c458704d15b8ff6c3426a95c65
|
372.3 kB | Preview Download |
Additional details
- Eprint ID
- 30057
- Resolver ID
- CaltechAUTHORS:20120411-102106234
- ONR
- N00014-08-1-0883
- ONR
- N00014-11-1-0025
- DARPA
- N66001-08-1-2065
- AFOSR
- FA9550-09-1-0643
- Sloan Research Fellowship
- Created
-
2012-05-30Created from EPrint's datestamp field
- Updated
-
2022-08-26Created from EPrint's last_modified field
- Caltech groups
- Applied & Computational Mathematics
- Series Name
- ACM Technical Reports
- Series Volume or Issue Number
- 2012-01