2008
DOI: 10.1214/009053607000000758
|View full text |Cite
|
Sign up to set email alerts
|

Regularized estimation of large covariance matrices

Abstract: This paper considers estimating a covariance matrix of $p$ variables from $n$ observations by either banding or tapering the sample covariance matrix, or estimating a banded version of the inverse of the covariance. We show that these estimates are consistent in the operator norm as long as $(\log p)/n\to0$, and obtain explicit rates. The results are uniform over some fairly natural well-conditioned families of covariance matrices. We also introduce an analogue of the Gaussian white noise model and show that i… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

11
1,220
0
3

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 1,107 publications
(1,234 citation statements)
references
References 28 publications
11
1,220
0
3
Order By: Relevance
“…The estimated covariance matrix in each case is close to the true value, with small mean square error, average and maximum absolute bias. We compare the estimation of the covariance matrix to a recent method by Bickel & Levina (2008) which bands the sample covariance matrix and proposes a resampling scheme for choosing the optimal banding parameter. The stochastic EM algorithm was also used to arrive at an approximate maximum a posteriori estimate of the covariance matrix.…”
Section: ·1 Factor Selection and Covariance Matrix Estimationmentioning
confidence: 99%
“…The estimated covariance matrix in each case is close to the true value, with small mean square error, average and maximum absolute bias. We compare the estimation of the covariance matrix to a recent method by Bickel & Levina (2008) which bands the sample covariance matrix and proposes a resampling scheme for choosing the optimal banding parameter. The stochastic EM algorithm was also used to arrive at an approximate maximum a posteriori estimate of the covariance matrix.…”
Section: ·1 Factor Selection and Covariance Matrix Estimationmentioning
confidence: 99%
“…This type of structure has also been used for estimating a high-dimensional covariance matrix (Bickel and Levina, 2008). In addition, because the correlations among variables (i.e.…”
Section: C2 Given a Set Of Multivariate Random Vectorsmentioning
confidence: 99%
“…In practice, Σ has to be estimated. We may apply an existing method, such as the banding and thresholding technique, to estimate a high-dimensional sparse covariance matrix (Bickel and Levina, 2008;Cai and Liu, 2011); see Cai et al (2016) for an excellent review. Under the α mixing assumption C2, σ ij is close to zero when |i − j| is large and thus we may apply the banding approach of Bickel and Levina (2008) …”
Section: C9 the Conditionally α-Mixingmentioning
confidence: 99%
See 2 more Smart Citations