The reviewed record of science sign in
Pith

arxiv: 1707.08885 · v1 · pith:APPFJV52 · submitted 2017-07-27 · stat.CO

Sequential Inverse Approximation of a Regularized Sample Covariance Matrix

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:APPFJV52record.jsonopen to challenge →

classification stat.CO
keywords matrixcovariancesequentialinversemethodsdataestimatorlearning
0
0 comments X
read the original abstract

One of the goals in scaling sequential machine learning methods pertains to dealing with high-dimensional data spaces. A key related challenge is that many methods heavily depend on obtaining the inverse covariance matrix of the data. It is well known that covariance matrix estimation is problematic when the number of observations is relatively small compared to the number of variables. A common way to tackle this problem is through the use of a shrinkage estimator that offers a compromise between the sample covariance matrix and a well-conditioned matrix, with the aim of minimizing the mean-squared error. We derived sequential update rules to approximate the inverse shrinkage estimator of the covariance matrix. The approach paves the way for improved large-scale machine learning methods that involve sequential updates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.