Search arXivSearch

arXiv · 1507.01649

Efficient Computation of Limit Spectra of Sample Covariance Matrices

Abstract

Consider an $n \times p$ data matrix $X$ whose rows are independently sampled from a population with covariance $Σ$. When $n,p$ are both large, the eigenvalues of the sample covariance matrix are substantially different from those of the true covariance. Asymptotically, as $n,p \to \infty$ with $p/n \to γ$, there is a deterministic mapping from the population spectral distribution (PSD) to the empirical spectral distribution (ESD) of the eigenvalues. The mapping is characterized by a fixed-point equation for the Stieltjes transform. We propose a new method to compute numerically the output ESD from an arbitrary input PSD. Our method, called Spectrode, finds the support and the density of the ESD to high precision; we prove this for finite discrete distributions. In computational experiments it outperforms existing methods by several orders of magnitude in speed and accuracy. We apply Spectrode to compute expectations and contour integrals of the ESD. These quantities are often central in applications of random matrix theory (RMT). We illustrate that Spectrode is directly useful in statistical problems, such as estimation and hypothesis testing for covariance matrices. Our proposal may make it more convenient to use asymptotic RMT in aspects of high-dimensional data analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Edgar Dobriban. 2015-07-07. Efficient Computation of Limit Spectra of Sample Covariance Matrices. https://doi.org/10.1142/s2010326315500197

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

KEEP EXPLORING

Related papers

$L^{p}$-convergence of Kantorovich-type Max-Min Neural Network Operators

In this work, we study the Kantorovich variant of max-min neural network operators, in which the operator kernel is defined in terms of sigmoidal functions. Our main aim is to demonstrate the $L^{p}$-convergence of these nonlinear operators for $1\leq p<\infty$, which makes it possible to obtain approximation results for functions that are not necessarily continuous. In addition, we will derive quantitative estimates for the rate of approximation in the $L^{p}$-norm. We will provide some explicit examples, studying the approximation of discontinuous functions with the max-min operator, and varying additionally the underlying sigmoidal function of the kernel. Further, we numerically compare the $L^{p}$-approximation error with the respective error of the Kantorovich variants of other popular neural network operators. As a final application, we show that the Kantorovich variant has advantages compared to the sampling variant of the max-min operator and Kantorovich variant of the max-product operator when it comes to approximate noisy functions as for instance biomedical ECG signals.

math.NA

Quotient geometry of tensor ring decomposition

Differential geometries derived from tensor decompositions have been extensively studied and provided the foundations for a variety of efficient numerical methods. Despite the practical success of the tensor ring (TR) decomposition, its intrinsic geometry remains less understood, primarily due to the underlying ring structure and the resulting nontrivial gauge invariance. We establish the quotient geometry and immersed-submanifold structure of TR decomposition by imposing full-rank conditions on all unfolding matrices of the core tensors and capturing the gauge invariance. The intrinsic ring structure of TR leads to an analysis that is substantially different from other tensor formats. Additionally, for the uniform TR decomposition, where all core tensors are identical and the manifold structure is known, we derive explicit parameterizations for the vertical and horizontal spaces, which enable Riemannian optimization. Numerical experiments validate the developed geometries via tensor ring completion tasks.

math.NA

Dissolution of carbonate stones caused by CO2 pollutant: Numerical modelling of erosion scenarios

In this paper, we introduce a mathematical model of carbonate-stone erosion driven by the penetration of CO2-derived acidity into the water-filled pore network. The model couples transport of the reactive aqueous species, calcite dissolution and porosity evolution, thereby representing the feedback by which dissolution increases porosity and modifies subsequent transport. Such model is formulated as nonlinear reaction-transport system in porous media governed by Darcy flow. We propose a numerical algorithm based on finite difference approximation that relies on level-set method at the boundaries and we show numerical tests that are in accordance with the literature in terms of the advancement of the erosion front.

math.NA