Nonasymptotic support recovery for high?dimensional sparse covariance matrices

نویسندگان

چکیده

We propose a general framework for nonasymptotic covariance matrix estimation making use of concentration inequality-based confidence sets. specify this the large sparse matrices through incorporation past thresholding estimators with key emphasis on support recovery. This technique goes beyond results by allowing wide range distributional assumptions merely sub-Gaussian tails. methodology can furthermore be adapted to other and settings. The usage dimension-free sets yields good theoretical performance. Through extensive simulations, it is demonstrated have superior performance when compared such methods. In context recovery, we are able false positive rate optimize maximize true recoveries.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factored sparse inverse covariance matrices

Most HMM-based speech recognition systems use Gaussian mixtures as observation probability density functions. An important goal in all such systems is to improve parsimony. One method is to adjust the type of covariance matrices used. In this work, factored sparse inverse covariance matrices are introduced. Based on U DU factorization, the inverse covariance matrix can be represented using line...

متن کامل

Improving Bilingual Projections via Sparse Covariance Matrices

Mapping documents into an interlingual representation can help bridge the language barrier of cross-lingual corpora. Many existing approaches are based on word co-occurrences extracted from aligned training data, represented as a covariance matrix. In theory, such a covariance matrix should represent semantic equivalence, and should be highly sparse. Unfortunately, the presence of noise leads t...

متن کامل

Estimation of Functionals of Sparse Covariance Matrices.

High-dimensional statistical tests often ignore correlations to gain simplicity and stability leading to null distributions that depend on functionals of correlation matrices such as their Frobenius norm and other ℓ r norms. Motivated by the computation of critical values of such tests, we investigate the difficulty of estimation the functionals of sparse correlation matrices. Specifically, we ...

متن کامل

Sketching Sparse Covariance Matrices and Graphs

This paper considers the problem of recovering a sparse p×p matrix X given an m×m matrix Y = AXB , where A and B are known m× p matrices with m p. The main result shows that there exist constructions of the “sketching” matrices A and B so that even if X has O(p) non-zeros, it can be recovered exactly and efficiently using convex optimization as long as these non-zeros are not concentrated in an...

متن کامل

Spectral Density of Sparse Sample Covariance Matrices

Applying the replica method of statistical mechanics, we evaluate the eigenvalue density of the large random matrix (sample covariance matrix) of the form J = ATA, where A is an M × N real sparse random matrix. The difference from a dense random matrix is the most significant in the tail region of the spectrum. We compare the results of several approximation schemes, focusing on the behavior in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stat

سال: 2021

ISSN: ['2049-1573']

DOI: https://doi.org/10.1002/sta4.316