Adaptive Hybrid PSO (AHPSO), which uses a sigmoid function on swarm diversity to automatically modulate gradient influence: near-zero during exploration, near-maximum during exploitation, with no manual phase-switching, is proposed.
Abstract
Gradient injection helps Particle Swarm Optimization (PSO) only when the swarm has identified a basin with smooth local structure, not universally. We propose Adaptive Hybrid PSO (AHPSO), which uses a sigmoid function on swarm diversity to automatically modulate gradient influence: near-zero during exploration, near-maximum during exploitation, with no manual phase-switching. Under budget-normalized comparison (PSO given equivalent total function evaluations), PSO wins 52.5% of 40 configurations versus AHPSO's 20% (p = 7.0e-5, Friedman). AHPSO retains advantage specifically on problems with smooth local basins (F8, F24-F27) where directed descent outperforms undirected sampling even at equal cost. Under iteration-matched comparison across 29 functions (42 configurations, 14,700 runs), AHPSO-Adadelta ranks first of 9 methods including CMA-ES (p = 9.75e-4). The contribution is a principled characterization of when gradient injection provides value in swarm-based search, not a claim of universal superiority.
Traditional particle swarm optimization (PSO) easily falls into premature convergence, while differential evolution (DE) is highly sensitive to fixed control parameters. Existing PSO-DE hybrid frameworks suffer from static population sizes and insufficient cross-population information exchange. This paper proposes PSO-...
Yao-Pei Wang, Yufeng Wang, Ke Liu· Algorithms· 0 citations
Particle swarm optimization (PSO) is a widely used bio-inspired optimization method. However, global guidance can align particle trajectories, reduce population diversity, and lead to premature convergence. To address this issue, we propose GRACE-PSO, a particle swarm optimizer based on group rank assessment and cooper...
This work analyzes how the PSO parameter coupling affects existing convergence guarantees for CBO and its variant with memory effect and shows that the coupling still leaves a non-empty set of admissible parameters for these convergence guarantees to hold, but the admissible parameter ranges shrink in the limits used t...
Franca Hoffmann, Dohyeon Kim, Ritvik Teegavarapu· 0 citations
Particle Swarm Optimization (PSO) remains highly effective on many continuous optimization problems, yet its search dynamics collapse too quickly on high-dimensional and deceptive landscapes. Our earlier work introduced single-role diversity-enhancing PSO variants and showed that diversity injection is effective only w...
Piotr Urbańczyk, Aleksandra Urbanczyk, Leszek Rutkowski et al.· Vietnam Journal of Computer...· 0 citations
Comprehensive experiments on numerical benchmarks and neuroevolution robotic control tasks demonstrate that AutoPSO consistently discovers novel PSO variants that significantly outperform strong baselines and confirm that AutoPSO achieves increasing performance gains with larger swarm sizes.
Xin-Meng Yu, Jia-Xin Gao, Jianguo Zhang et al.· IEEE Transactions on Evoluti...· 1 citation
Gradient Descent (GD) is among the classic and most common optimization algorithms in machine learning, signal processing and numerical optimization. Although conceptually appealing and simple, traditional gradient descent with a constant learning rate is prone to slow convergence, oscillation or divergence, particular...
D. Sharma, Vikram Sethi· International Journal of Mac...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
