A modified Adam algorithm for deep neural network optimization

• Published in: Neural computing & applications Vol. 35; no. 23; pp. 17095 - 17112
• Main Authors: Reyad, Mohamed, Sarhan, Amany M., Arafa, M.
• Format: Journal Article
• Language: English
• Published: London Springer London 01.08.2023; Springer Nature B.V
• Subjects: Accuracy; Adaptive algorithms; Algorithms; Artificial Intelligence; Artificial neural networks; Computational Biology/Bioinformatics; Computational Science and Engineering; Computer Science; Convergence; Data Mining and Knowledge Discovery; Datasets; Image Processing and Computer Vision; Machine learning; Mathematical models; Neural networks; Optimization; Original Article; Parameter modification; Performance evaluation; Probability and Statistics in Computer Science; Training; Adam; RMSprop; Optimizer; AMSGrad; Nesterov Accelerated Adam; Deep Neural Networks; Adaptive Moment Estimation
• ISSN: 0941-0643; 1433-3058
• DOI: 10.1007/s00521-023-08568-z

Deep Neural Networks (DNNs) are widely regarded as the most effective learning tool for dealing with large datasets, and they have been successfully used in thousands of applications in a variety of fields. Based on these large datasets, they are trained to learn the relationships between various variables. The adaptive moment estimation (Adam) algorithm, a highly efficient adaptive optimization algorithm, is widely used as a learning algorithm in various fields for training DNN models. However, it needs to improve its generalization performance, especially when training with large-scale datasets. Therefore, in this paper, we propose HN Adam, a modified version of the Adam Algorithm, to improve its accuracy and convergence speed. The HN_Adam algorithm is modified by automatically adjusting the step size of the parameter updates over the training epochs. This automatic adjustment is based on the norm value of the parameter update formula according to the gradient values obtained during the training epochs. Furthermore, a hybrid mechanism was created by combining the standard Adam algorithm and the AMSGrad algorithm. As a result of these changes, the HN_Adam algorithm, like the stochastic gradient descent (SGD) algorithm, has good generalization performance and achieves fast convergence like other adaptive algorithms. To test the proposed HN_Adam algorithm performance, it is evaluated to train a deep convolutional neural network (CNN) model that classifies images using two different standard datasets: MNIST and CIFAR-10. The algorithm results are compared to the basic Adam algorithm and the SGD algorithm, in addition to other five recent SGD adaptive algorithms. In most comparisons, the HN Adam algorithm outperforms the compared algorithms in terms of accuracy and convergence speed. AdaBelief is the most competitive of the compared algorithms. In terms of testing accuracy and convergence speed (represented by the consumed training time), the HN-Adam algorithm outperforms the AdaBelief algorithm by an improvement of 1.0% and 0.29% for the MNIST dataset, and 0.93% and 1.68% for the CIFAR-10 dataset, respectively.