首页> 外文会议>Artificial intelligence amp; soft computing >MULTI-LAYERED NETWORKS WITH FREE ENERGY-BASED COMPETITIVE LEARNING
【24h】

MULTI-LAYERED NETWORKS WITH FREE ENERGY-BASED COMPETITIVE LEARNING

机译:具有基于免费能源的竞争性学习的多层网络

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we propose a new method to interpret and to improve the performance of multi-layered networks. In this method, we can select important competitive units by decreasing conditional entropy of competitive units for input patterns. As the entropy is decreased, only a small number of competitive units becomes activated, while all the other units are inactive. The conditional entropy is changed by decreasing the Gaussian width and we have no specific relevance measures to detect important competitive units. In addition, this conditional entropy is changed by using the free energy function similar to that in statistical mechanics. By using this free energy function, the heavy computation in conditional entropy is reduced to the computation of simple partition functions. We applied the method to the XOR problem and the cabinet approval ratings estimation. In the XOR problem, experimental results show that the number of hidden units effective in learning is reduced considerably by decreasing the Gaussian width σ. In addition, in the cabinet approval ratings estimation, experimental results confirmed that the number of important hidden units was considerably reduced by decreasing the Gaussian width, and generalization performance could be significantly improved.
机译:在本文中,我们提出了一种新的方法来解释和提高多层网络的性能。在这种方法中,我们可以通过减少输入模式的竞争单元的条件熵来选择重要的竞争单元。随着熵的降低,只有少数竞争单元被激活,而所有其他单元都处于非激活状态。通过降低高斯宽度可以改变条件熵,我们没有特定的相关度量来检测重要的竞争单位。另外,通过使用类似于统计力学中的自由能函数来改变该条件熵。通过使用此自由能函数,将条件熵的繁重计算减少为简单分区函数的计算。我们将该方法应用于XOR问题和内阁批准等级估计。在XOR问题中,实验结果表明,通过减小高斯宽度σ可以显着减少有效学习的隐藏单元数。另外,在内阁批准等级估计中,实验结果证实,通过减小高斯宽度,可以大大减少重要隐藏单元的数量,并且可以显着提高泛化性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号