Excitation-Oriented Forgetting Recursive Least Squares
To address the deficiencies in neural network learning performance caused by the use of stochastic gradient descent (SGD) and conventional recursive least squares (RLS) in real-time learning tasks based on radial basis function neural networks (RBFNNs), this paper introduces a novel parameter optimization algorithm for training neural networks, termed excitation-oriented forgetting recursive least squares (EOFRLS). The EOFRLS algorithm allocates the forgetting factor based on the persistent excitation (PE) level and error at each time point of the training trajectory, thereby enhancing the learning performance of the neural network. Theoretical analysis and function approximation simulations demonstrate that EOFRLS achieves higher learning accuracy and faster convergence rates compared to SGD, conventional RLS, and RLS with a forgetting factor.
Authors
- Jun Li (ORCID: https://orcid.org/0000-0002-1958-5665)
- Juncheng Xu
- Lukai Bin
Institutions
- Harbin Institute of Technology (CN)
Publication Details
- Published
- 2025-07-04
- DOI
- https://doi.org/10.1109/fasta65681.2025.11138789
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00