首页> 外文会议>IEEE Symposium Series on Computational Intelligence >A Levenberg-Marquardt Algorithm Based Incremental Scheme for Complex-Valued Neural Networks
【24h】

A Levenberg-Marquardt Algorithm Based Incremental Scheme for Complex-Valued Neural Networks

机译:基于Levenberg-Marquardt算法的增值神经网络增量方案

获取原文

摘要

In this paper, an efficient learning algorithm is proposed for complex-valued neural networks. It can well tune the weights and bias by complex-valued Levenberg-Marquardt (LM) algorithm and optimize the network structure by an incremental mechanism. Firstly, compared with the first-order algorithm, such as complex-valued gradient descent algorithm, complex-valued LM algorithm overcomes the problem of slow convergence for training complex-valued neural networks. Secondly, for practical applications, the choice of optimization algorithms is over-emphasized, while the effect of the network structure on performance is ignored. Indeed, the complexity of the structure is crucial to the generalization capability. Therefore, in order to improve the performance of complex-valued neural networks, an incremental mechanism is adopted to determine the network structure during the training process. Experimental results show the effectiveness of the proposed algorithm.
机译:在本文中,提出了一种用于复值神经网络的有效学习算法。它可以通过复值Levenberg-Marquardt(LM)算法很好地调整权重和偏差,并通过增量机制优化网络结构。首先,与一阶算法(如复值梯度下降算法)相比,复值LM算法克服了训练复值神经网络收敛速度慢的问题。其次,对于实际应用,过分强调了优化算法的选择,而忽略了网络结构对性能的影响。实际上,结构的复杂性对于泛化能力至关重要。因此,为了提高复值神经网络的性能,在训练过程中采用增量机制确定网络结构。实验结果表明了该算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号