View Submission - CMStatistics

B1040
**Title: **RSVP-graphs: Fast high-dimensional covariance matrix estimation under latent confounding
**Authors: **Rajen D Shah - University of Cambridge (United Kingdom) **[presenting]**

Benjamin Frot - ETH Zürich (Switzerland)

Gian-Andrea Thanei - ETH Zürich (Switzerland)

Nicolai Meinshausen - ETH Zurich (Switzerland)

**Abstract: **The focus in on the problem of estimating a high-dimensional $p \times p$ covariance matrix $\Sigma$, given $n$ observations of confounded data with covariance $\Sigma + \Gamma \Gamma^T$, where $\Gamma$ is an unknown $p \times 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 approaches based on removal of principal components, RSVP is able to cope well with settings where the smallest eigenvalue of $\Gamma^T \Gamma$ is relatively close to the largest eigenvalue of $\Sigma$, as well as when eigenvalues of $\Gamma^T \Gamma$ are diverging fast. 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.

Benjamin Frot - ETH Zürich (Switzerland)

Gian-Andrea Thanei - ETH Zürich (Switzerland)

Nicolai Meinshausen - ETH Zurich (Switzerland)