Answers are grounded in this paper and cite their sources.
I show analytically that the average of k bootstrapped correlation matrices rapidly becomes positive-definite as k increases, which provides a simple approach to regularize singular Pearson correlation matrices. If n is the order of the matrix and t the number of features, the averaged correlation matrix is almost surely positive-definite if k>ee−1nt≃1.58nt in the limit of large t and n. The probability of obtaining a positive-definite correlation matrix with k bootstraps is also derived for finite n and t. Finally, I demonstrate that the number of required bootstraps is always smaller than n. This method is particularly relevant in fields where n is orders of magnitude larger than the size of data points t, e.g., in finance, genetics, social science, or image processing.
No takes yet. Share an insight, caveat, or question.
Christian Bongiorno (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: