A Reliable Resilient Backpropagation Method with Gradient Ascent
While the Resilient Backpropagation (RPROP) method can be extremely fast in converging to a solution, it suffers from the local minima problem. In this paper, a fast and reliable learning algorithm for multi-layer artificial neural networks is proposed. The learning model has two phases: the RPROP phase and the gradient ascent phase. The repetition of two phases can help the network get out of local minima. The proposed algorithm is tested on some benchmark problems. For all the above problems, the systems are shown to be capable of escaping from the local minima and converge faster than the Backpropagation with momentum algorithm and the simulated annealing techniques.
KeywordsLocal Minimum Gain Parameter Simulated Annealing Method Gradient Ascent Local Minimum Problem
Unable to display preview. Download preview PDF.