A Preconditioned Unconstrained Optimization Method for Training Multilayer Feed-forward Neural Network
Abstract
Non-linear unconstrained optimization methods constitute excellent neural network training methods characterized by their simplicity and efficiency. In this paper, we propose a new preconditioned conjugate gradient neural network training algorithm which guarantees descent property with standard Wolfe condition. Encouraging numerical experiments verify that the proposed algorithm provides fast and stable convergence.
Keywords
References
- L. E. Achenie, Computational experience with a quasi Newton method based training of feed-forward neural networks, Proc. World Congress on Neural Networks, San Diego, 1994, III607-III612.
- A. Andreas and S. Wu, Practical optimization algorithms and engineering applications, Springer US, 2007, 1-26.
- R. Battiti, First-and second-order methods for learning: between steepest descent and New-ton's method, Neural Comput., 4(2) 1992, 141-166.
- R. Battiti and F. Masulli, BFGS optimization for faster and automated supervised learning, In International neural network conference, Springer, Dordrecht, 1990 .
- C. M. Bishop, Neural networks for pattern recognition. Oxford university press, 1995.
- E. Birgin and J. Martinez, A spectral conjugate gradient method for unconstrained optimization, Appl. Math. Opt., 43(2) 2001, 117-128.
- C. Charalambous, Conjugate gradient algorithm for efficient training of artificial neural networks, “IEE Proceedings G (Circuits, Devices and Systems)”, 139(3) 1992, 301-310.
- R. Fletcher and C.M. Reeves, Function minimization by conjugate gradients, Comput. J., 7(2) 1964, 149-154.
Details
Primary Language
English
Subjects
Mathematical Sciences
Journal Section
Research Article
Publication Date
February 24, 2020
Submission Date
December 13, 2018
Acceptance Date
February 24, 2020
Published in Issue
Year 2019 Volume: 2 Number: 2