Adaptive Levenberg–Marquardt Algorithm: A New Optimization Strategy for Levenberg–Marquardt Neural Networks

• Published in: Mathematics (Basel) Vol. 9; no. 17; p. 2176
• Main Authors: Yan, Zhiqi, Zhong, Shisheng, Lin, Lin, Cui, Zhiquan
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.09.2021
• Subjects: Adaptive algorithms; Algorithms; Approximation; Convergence; Levenberg–Marquardt algorithm; local minima; Mathematics; Network management systems; Neural networks; Optimization; Parameters
• ISSN: 2227-7390; 2227-7390
• DOI: 10.3390/math9172176

Engineering data are often highly nonlinear and contain high-frequency noise, so the Levenberg–Marquardt (LM) algorithm may not converge when a neural network optimized by the algorithm is trained with engineering data. In this work, we analyzed the reasons for the LM neural network’s poor convergence commonly associated with the LM algorithm. Specifically, the effects of different activation functions such as Sigmoid, Tanh, Rectified Linear Unit (RELU) and Parametric Rectified Linear Unit (PRLU) were evaluated on the general performance of LM neural networks, and special values of LM neural network parameters were found that could make the LM algorithm converge poorly. We proposed an adaptive LM (AdaLM) algorithm to solve the problem of the LM algorithm. The algorithm coordinates the descent direction and the descent step by the iteration number, which can prevent falling into the local minimum value and avoid the influence of the parameter state of LM neural networks. We compared the AdaLM algorithm with the traditional LM algorithm and its variants in terms of accuracy and speed in the context of testing common datasets and aero-engine data, and the results verified the effectiveness of the AdaLM algorithm.