SearcharxivSearch

arXiv · 1010.0601

A Random Matrix--Theoretic Approach to Handling Singular Covariance Estimates

Abstract

In many practical situations we would like to estimate the covariance matrix of a set of variables from an insufficient amount of data. More specifically, if we have a set of $N$ independent, identically distributed measurements of an $M$ dimensional random vector the maximum likelihood estimate is the sample covariance matrix. Here we consider the case where $N<M$ such that this estimate is singular and therefore fundamentally bad. We present a radically new approach to deal with this situation. Let $X$ be the $M\times N$ data matrix, where the columns are the $N$ independent realizations of the random vector with covariance matrix $\Sigma$. Without loss of generality, we can assume that the random variables have zero mean. We would like to estimate $\Sigma$ from $X$. Let $K$ be the classical sample covariance matrix. Fix a parameter $1\leq L\leq N$ and consider an ensemble of $L\times M$ random unitary matrices, $\{\Phi\}$, having Haar probability measure. Pre and post multiply $K$ by $\Phi$, and by the conjugate transpose of $\Phi$ respectively, to produce a non--singular $L\times L$ reduced dimension covariance estimate. A new estimate for $\Sigma$, denoted by $\mathrm{cov}_L(K)$, is obtained by a) projecting the reduced covariance estimate out (to $M\times M$) through pre and post multiplication by the conjugate transpose of $\Phi$, and by $\Phi$ respectively, and b) taking the expectation over the unitary ensemble. Another new estimate (this time for $\Sigma^{-1}$), $\mathrm{invcov}_L(K)$, is obtained by a) inverting the reduced covariance estimate, b) projecting the inverse out (to $M\times M$) through pre and post multiplication by the conjugate transpose of $\Phi$, and by $\Phi$ respectively, and c) taking the expectation over the unitary ensemble. We have a closed analytical expression for $\mathrm{invcov}_L(K)$ and $\mathrm{cov}_L(K)$ in terms of its eigenvalue decomposition.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas L. Marzetta, Gabriel H. Tucci, Steven H. Simon. 2010-10-04. A Random Matrix--Theoretic Approach to Handling Singular Covariance Estimates. https://arxiv.org/abs/1010.0601

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR