The Hybrid Learning Algorithm Which is Based on em Algorithm and can Globally Converge with Probability 1
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [1]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    In this paper, the drawback is pointed out that the learning algorithm em of random neural network sometimes converges to local minimum. A new hybrid learning algorithm HRem, which combines algorithm em and the random optimization algorithm presented by Dr. Solis and Wets, is presented for 3-layer random perception. It is theoretically proved that algorithm HRem can globally converge to the minimum of Kullback-Leibler difference measure. This theoretical result has important significances for further research on algorithm em.

    Reference
    1  Amari S. Information theory of the EM and em algorithm for neural networks. Neural Networks, 1995,8(5):10~16 2  Amari S. Differential geometrical methods in statistics. Springer-Verlag, 1985 3  Jordan M et al. Hierarchical mixture of experts and EM algorithm. Neural Computation, 1994,(6) 4  张建,史忠植.多层随机神经网络em算法.计算机研究与发展,1996,33(11):808~815 (Zhang Jian, Shi Zhong-zhi. Algorithm em of multilayer random neural network. Journal of Computer Research and Development, 1996,33(11):808~815)
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

王士同.基于em算法且能以概率1全局收敛的混合学习算法.软件学报,1998,9(6):448-452

Copy
Share
Article Metrics
  • Abstract:4543
  • PDF: 4745
  • HTML: 0
  • Cited by: 0
History
  • Received:May 04,1997
  • Revised:June 16,1997
You are the first2038690Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063