Recover the spectrum of covariance matrix: a non-asymptotic iterative method
It is well known the sample covariance has a consistent bias in the spectrum, for example spectrum of Wishart matrix follows the Marchenko-Pastur law. We in this work introduce an iterative algorithm 'Concent' that actively eliminate this bias and recover the true spectrum for small and moderate dimensions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Spectrum Estimation from Samples
We consider the problem of approximating the set of eigenvalues of the covariance matrix of a multivariate distribution (equivalently, the problem of approximating the "population spectrum"), given access to samples draw…
Toeplitz Inverse Eigenvalue Problem (ToIEP) and Random Matrix Theory (RMT) Support for the Toeplitz Covariance Matrix Estimation
"Toeplitzification" or "redundancy (spatial) averaging", the well-known routine for deriving the Toeplitz covariance matrix estimate from the standard sample covariance matrix, recently regained new attention due to the …
Iterative Sparse Recovery based Passive Localization in Perceptive Mobile Networks
Perceptive mobile networks (PMNs) were proposed to integrate sensing capability into current cellular networks where multiple sensing nodes (SNs) can collaboratively sense the same targets. Besides the active sensing in …
Generalization for Least Squares Regression With Simple Spiked Covariances
Random matrix theory has proven to be a valuable tool in analyzing the generalization of linear models. However, the generalization properties of even two-layer neural networks trained by gradient descent remain poorly u…
regressionHigh-Dimensional Asymptotics of Prediction: Ridge Regression and Classification
We provide a unified analysis of the predictive risk of ridge regression and regularized discriminant analysis in a dense random effects model. We work in a high-dimensional asymptotic regime where $p, n \to \infty$ and …
ClassificationGeneral ClassificationregressionVocal Bursts Intensity Prediction