Deep learning optimizer based on metaheuristic algorithms
Deep learning technology has been widely used in artificial intelligence. A successful training of deep learning model is inseparable from the operation of optimization applied by good optimizers. However, the widely used traditional optimizers based on gradient descent, such as stochastic gradient descent (SGD), stochastic gradient descent-momentum (SGD-M), adaptive moment estimation (Adam), and proportional integral derivative (PID) have common problems including being prone to local optima due to gradient vanishing, training termination due to gradient explosion. These problems can be solved by optimizers based on metaheuristic algorithms proposed in the study due to their better global optimization ability and stronger adaptability than gradient descent algorithms. Four different metaheuristic deep learning optimizers were implemented using four different metaheuristics algorithms including particle swarm optimization (PSO), simulated annealing (SA), genetic algorithm (GA), and grey wolf optimization (GWO). These optimizers are tested on the CIFAR and MNIST dataset for image classification task. Experimental results show that these metaheuristic optimizers outperform traditional optimizers.
Authors
- Kuntao Ye (ORCID: https://orcid.org/0000-0001-5780-6310)
- Yue Zhang (ORCID: https://orcid.org/0009-0004-6091-7213)
- S. Qiu
- Hong Ji
Institutions
- Jiangxi University of Science and Technology (CN)
Publication Details
- Published
- 2025-03-21
- DOI
- https://doi.org/10.1145/3745533.3745580
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00