RSVP-graphs: Fast High-dimensional Covariance Matrix Estimation under Latent Confounding
share
In this work we consider the problem of estimating a high-dimensional p × p covariance matrix Σ, given n observations of confounded data with covariance Σ + ΓΓ^T, where Γ is an unknown p × q matrix of latent factor loadings. We propose a simple and scalable estimator based on the projection on to the right singular vectors of the observed data matrix, which we call RSVP. Our theoretical analysis of this method reveals that in contrast to PCA-based approaches, RSVP is able to cope well with settings where the smallest eigenvalue of Γ^T Γ is close to the largest eigenvalue of Σ, as well as settings where the eigenvalues of Γ^T Γ are diverging fast. It is also able to handle data that may have heavy tails and only requires that the data has an elliptical distribution. RSVP does not require knowledge or estimation of the number of latent factors q, but only recovers Σ up to an unknown positive scale factor. We argue this suffices in many applications, for example if an estimate of the correlation matrix is desired. We also show that by using subsampling, we can further improve the performance of the method. Numerical experiments support the conclusions of our theoretical analyses.
READ FULL TEXT