摘要
针对前馈神经网络学习误差函数维数高、计算复杂度大的特点 ,对梯度下降BP算法加以改进从而构造出一种简单共轭梯度下降算法 (MPARTAN算法 ) .该算法计算复杂度不高于动量BP算法 ,与FR共轭梯度法相比 ,该算法的稳定性好 ,又具有共轭梯度法的优点 ,收敛速度快 .文中给出了该算法的收敛定理 ,并用 2个实验例子比较了动量BP算法。
The high dimension of the learning error function for BP networks and the difficult computation complexity are investigated. A simple modified conjugation gradient decent algorithm (MPARTAN) is proposed based on improving the gradient BP algorithm. The computational complexity of this algorithm is not higher than that of the BP momentum algorithm. Compared with FR conjugation algorithm, this algorithm has better stability and fast speed quality of convergence. It is also investigated that the convergence theorems for this algorithm and comparison of the computing results by two examples for the promoted three algorithms: BP momentum algorithm, FR conjugation gradient algorithm and the novel MPARTAN algorithm.
出处
《北京航空航天大学学报》
EI
CAS
CSCD
北大核心
2000年第5期596-599,共4页
Journal of Beijing University of Aeronautics and Astronautics
基金
国家自然科学基金资助项目! ( 6970 50 0 1)
