article · Asian Research Journal of Mathematics
Optimizing deep neural networks (DNNs) presents significant challenges due to complex loss landscapes, hyperparameter sensitivity, and slow convergence rates. This study introduces a Hybrid Gradient-Based Particle Swarm Optimization (HG-PSO) framework that combines the global search capability of Particle Swarm Optimization (PSO) with the local refinement efficiency of gradient-based methods. The proposed approach dynamically balances exploration and exploitation, leading to improved convergence speed, reduced overfitting, and enhanced generalization performance. Experimental evaluations using benchmark datasets—Fashion-MNIST, SVHN, and Tiny ImageNet—demonstrate that HG-PSO outperforms traditional optimizers such as Stochastic Gradient Descent (SGD), Adam, and standalone PSO. HG-PSO achieves a 15% reduction in training errors and a 12% increase in validation accuracy on average. Additionally, the method exhibits superior robustness against noisy gradients, making it well-suited for real-world deep-learning applications. These results establish HG-PSO as a powerful and efficient optimization strategy for neural network training.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.9734/arjom/2025/v21i8971
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.