Many kernel-based learning algorithms have the computational load scaled with the sample size n due to the column size of a full kernel Gram matrix K. This article considers the Nyström low-rank approximation. It uses a reduced kernel K̂, which is n×m, consisting of m columns (say columns...

In this paper, we establish three identities which play a crucial role in deriving the asymptotic distributional risk function and the asymptotic distributional bias of a large class of estimators of a matrix parameter. In particular, we generalize the results in Judge and Bock (The statistical...

This paper revisits the methodology of Stein (1975, 1986) for estimating a covariance matrix in the setting where the number of variables can be of the same magnitude as the sample size. Stein proposed to keep the eigenvectors of the sample covariance matrix but to shrink the eigenvalues. By...

This paper introduces a new method for deriving covariance matrix estimators that are decision-theoretically optimal. The key is to employ large-dimensional asymptotics: the matrix dimension and the sample size go to infinity together, with their ratio converging to a finite, nonzero limit. As...

Using the eigenvalues and eigenvectors of correlations matrices of some of the main financial market indices in the world, we show that high volatility of markets is directly linked with strong correlations between them. This means that markets tend to behave as one during great crashes. In...