RSVP-graphs: Fast High-dimensional Covariance Matrix Estimation under Latent Confounding

DOI10.1111/RSSB.12359MaRDI QIDQ6309149arXivFDO

Authors Rajen D. Shah, Benjamin Frot, Gian-Andrea Thanei, Nicolai Meinshausen

Publication date 2 November 2018

Published in arXiv

Full work available at URL https://doi.org/10.1111/RSSB.12359

Mathematics Subject Classification ID

Statistics (62-XX)

arXiv classification

math.STstat.MEstat.TH

Abstract: In this work we consider the problem of estimating a high-dimensional $pimesp$ covariance matrix $Sigma$, given $n$ observations of confounded data with covariance $Sigma+GammaGamm{a}^T$, where $Gamma$ is an unknown $pimesq$ 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 $Gamm{a}^{T}Gamma$ is close to the largest eigenvalue of $Sigma$, as well as settings where the eigenvalues of $Gamm{a}^{T}Gamma$ 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 $Sigma$ 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. We demonstrate the favourable performance of RSVP through simulation experiments and an analysis of gene expression datasets collated by the GTEX consortium.

This page was built for publication: RSVP-graphs: Fast High-dimensional Covariance Matrix Estimation under Latent Confounding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6309149)