摘要
By introducing an arbitrary diagonal matrix, a generalized energy function (GEF) is proposed for searching for the optimum weights of a two layer linear neural network. From the GEF, we derive a recur- sive least squares (RLS) algorithm to extract in parallel multiple principal components of the input covari- ance matrix without designing an asymmetrical circuit. The local stability of the GEF algorithm at the equilibrium is analytically verified. Simulation results show that the GEF algorithm for parallel multiple principal components extraction exhibits the fast convergence and has the improved robustness resis- tance to the eigenvalue spread of the input covariance matrix as compared to the well-known lateral inhi- bition model (APEX) and least mean square error reconstruction (LMSER) algorithms.
By introducing an arbitrary diagonal matrix, a generalized energy function (GEF) is proposed for searching for the optimum weights of a two layer linear neural network. From the GEF, we derive a recur- sive least squares (RLS) algorithm to extract in parallel multiple principal components of the input covari- ance matrix without designing an asymmetrical circuit. The local stability of the GEF algorithm at the equilibrium is analytically verified. Simulation results show that the GEF algorithm for parallel multiple principal components extraction exhibits the fast convergence and has the improved robustness resis- tance to the eigenvalue spread of the input covariance matrix as compared to the well-known lateral inhi- bition model (APEX) and least mean square error reconstruction (LMSER) algorithms.
基金
supported in part by the National Natural Science Foundation of China(Grant Nos.60172011 and 69831040)
Guangxi Natural Science Foundation(Grant No.gzk0007011)
the Science Foundation of Guangxi Education Bureau,China
