Jian, C.L., Zhang, Y. and Tan, K.K. (2006) Global Convergence of Oja’s PCA Learning Algorithm with a Non-Zero-Approaching Adaptive Learning Rate. Theoretical Computer Science, 367, 286-307.
https://doi.org/10.1016/j.tcs.2006.07.012

has been cited by the following article:

• TITLE: Convergence Analysis of a Kind of Deterministic Discrete-Time PCA Algorithm

  AUTHORS: Ze Zhu, Wanzhou Ye, Haijun Kuang

  KEYWORDS: GALR PCA Algorithm, DDT Method, Global Convergence, Online Data

  JOURNAL NAME: Advances in Pure Mathematics, Vol.11 No.5, May 24, 2021

  ABSTRACT: We proposed a generalized adaptive learning rate (GALR) PCA algorithm, which could be guaranteed that the algorithm’s convergence process would not be affected by the selection of the initial value. Using the deterministic discrete time (DDT) method, we gave the upper and lower bounds of the algorithm and proved the global convergence. Numerical experiments had also verified our theory, and the algorithm is effective for both online and offline data. We found that choosing different initial vectors will affect the convergence speed, and the initial vector could converge to the second or third eigenvectors by satisfying some exceptional conditions.