Global convergence of Oja's subspace algorithm for principal component extraction

Oja's principal subspace algorithm is a well-known and powerful technique for learning and trackingprincipal information in time series. A thorough investigation of the convergence property of Oja'salgorithm is undertaken in this paper. The asymptotic convergence rates of the algorithm is discovered. The dependence of the algorithm on its initial weight matrix and the singularity of the data covariance matrix is comprehensively addresse