|
|
|
| Study of Adaptive Algorithms for Optimally Weighted Stochastic Pooling Networks |
| HAN Bo, JING Wenteng, GENG Jinhua, DUAN Fabing
|
| Institute of Complexity Science, Qingdao University, Qingdao 266071, China |
|
|
|
|
Abstract In this paper, the adaptive algorithm of optimally weighted stochastic pool network is studied. The mean square error is used as the output performance evaluation index of the stochastic pooling network. The recursive expressions of the least mean square (LMS) algorithm and the Kalman-LMS algorithm are derived. The related results show that, for the nonstationary case of varying variances of inputs, both adaptive algorithms can converge to the optimal solution of weight vectors. However, the Kalman-LMS algorithm not only has a fast convergence speed, but also the weight mean square deviation is optimal at each step. When the number of network nodes is small, Kalman-LMS can obtain a smaller mean square error. As the number of network nodes increases, the mean square error obtained by the two adaptive algorithms tends to be consistent.
|
|
Published: 16 May 2019
|
|
|
|
|
|
|
|
|
