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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Wang, X., Wang, H., Dai, G., & Tang, Z. (2006). A reliable resilient backpropagation method with gradient ascent. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4114 LNAI-II, pp. 236–244). Springer Verlag. https://doi.org/10.1007/978-3-540-37275-2_31
Mendeley helps you to discover research relevant for your work.