# Sufficient ensemble size for random matrix theory-based handling of singular covariance matrices

Research output: Contribution to journal › Article › peer-review

## Standard

**Sufficient ensemble size for random matrix theory-based handling of singular covariance matrices.** / Kaban, Ata.

Research output: Contribution to journal › Article › peer-review

## Harvard

*Analysis and Applications*, vol. 18, no. 5, pp. 929-950. https://doi.org/10.1142/S0219530520400072

## APA

*Analysis and Applications*,

*18*(5), 929-950. https://doi.org/10.1142/S0219530520400072

## Vancouver

## Author

## Bibtex

}

## RIS

TY - JOUR

T1 - Sufficient ensemble size for random matrix theory-based handling of singular covariance matrices

AU - Kaban, Ata

PY - 2020/7/17

Y1 - 2020/7/17

N2 - Singular covariance matrices are frequently encountered in both machine learning and optimization problems, most commonly due to high dimensionality of data and insufficient sample sizes. Among many methods of regularization, here we focus on a relatively recent random matrix theoretic approach, the idea of which is to create well-conditioned approximations of a singular covariance matrix and its inverse by taking the expectation of its random projections. We are interested in the error of a Monte Carlo implementation of this approach, which allows subsequent parallel processing in low dimensions in practice. We find that O(d) random projections, where d is the size of the original matrix,are sufficient for the Monte Carlo error to become negligible, in the sense of expected spectral norm difference, for both covariance and inverse covariance approximation, in the latter case under mild assumptions.

AB - Singular covariance matrices are frequently encountered in both machine learning and optimization problems, most commonly due to high dimensionality of data and insufficient sample sizes. Among many methods of regularization, here we focus on a relatively recent random matrix theoretic approach, the idea of which is to create well-conditioned approximations of a singular covariance matrix and its inverse by taking the expectation of its random projections. We are interested in the error of a Monte Carlo implementation of this approach, which allows subsequent parallel processing in low dimensions in practice. We find that O(d) random projections, where d is the size of the original matrix,are sufficient for the Monte Carlo error to become negligible, in the sense of expected spectral norm difference, for both covariance and inverse covariance approximation, in the latter case under mild assumptions.

KW - Singular covariance

KW - precision matrix

KW - curse of dimensionality

KW - random projections;

KW - Monte Carlo error

U2 - 10.1142/S0219530520400072

DO - 10.1142/S0219530520400072

M3 - Article

VL - 18

SP - 929

EP - 950

JO - Analysis and Applications

JF - Analysis and Applications

SN - 0219-5305

IS - 5

ER -