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 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...