一种快速逃离局部极小点的BP算法

Faster escaping from local minima for back-propagation algorithm

针对反向传播(BP)算法容易陷入局部极小点的问题,提出了一种改进价值函数,使其快速收敛到全局最小点的方法。对扩展的异或问题正弦函数模拟进行了仿真实验,结果对比表明,改进的BP算法能快速逃离局部极小点,收敛到全局最小点,达到了期望的效果。

With the purpose of solving the local minima of standard Back-Propagation （BP） algorithm, a modified error function was proposed to escape from the local minima and converge to the global minima. A modified XOR was used. The result contrast indicates that the new back-propagation algorithm can fast escape from the local minima and converge to the global minima, which is just within the expectation.