.png){kind=icon}
.png){kind=icon}
Return
A Principal Component Estimation Algorithm with Adaptive Learning Rate and Its Convergence Analysis
.png){kind=icon}
OA
AI
DOI：10.3390/app152111826.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The deterministic discrete-time method is a dominant approach for analyzing neural network algorithms. To address the issue where conventional convergence conditions impose stringent restrictions on the range of learning factors, this paper proposes a principal component estimation algorithm with an adaptive learning factor, which guarantees global convergence. The convergence of the algorithm is analyzed using the deterministic discrete-time method, and conditions ensuring convergence are established. Unlike convergence conditions for other algorithms, the proposed algorithm's convergence conditions eliminate restrictions on the learning factor, thereby extending its feasible range. Simulation results demonstrate that the proposed algorithm effectively resolves ill-conditioned matrix problems. When compared with existing algorithms, the proposed algorithm exhibits significantly faster convergence speed than several current methods.
Keywords:
adaptive learning factor
principal component
deterministic discrete-time
convergence analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
2.5
Papers:
7.3K
Citations:
4
View more organizations