Comparison study of the combination of the SPSA algorithm and the PSO algorithm
Bertrand Ngansop, Stefan G\"otz, Martin Eckl

TL;DR
This study explores combining SPSA with PSO to improve global best updates, introducing three novel methods that enhance optimization performance with minimal additional computational cost.
Contribution
The paper proposes three innovative approaches integrating SPSA into PSO to address its global best update limitations, demonstrating significant performance improvements.
Findings
Enhanced PSO performance on non-linear functions
Significant improvement in optimization quality
Low overhead cost with proposed methods
Abstract
Particle swarm optimization (PSO) is attracting an ever-growing attention and more than ever it has found many application areas for many challenging optimization problems. It is, however, a known fact that PSO has a severe drawback in the update of its global best (gbest) particle, which has a crucial role of guiding the rest of the swarm. In this paper, we propose three efficient solutions to remedy this problem using the SPSA Algorithm. In the first approach, gbest is updated with respect to a global estimation of the gradient and can avoid getting trapped into a local optimum. The second approach is based on the formation of an alternative or artificial global best particle, the so-called aGB, which can replace the native gbest particle for a better guidance, the decision of which is held by a fair competition between the two. The third approach is based on the update of the swarm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research
