ArXiv TLDR

Deep Neural Network-guided PSO for Tracking a Global Optimal Position in Complex Dynamic Environment

🐦 Tweet
2604.14064

Stephen Raharja, Toshiharu Sugawara

cs.NE

TLDR

This paper introduces DNN-guided Particle Swarm Optimization (PSO) variants to efficiently track moving global optima in dynamic environments.

Key contributions

  • Proposes novel PSO variants integrated with Deep Neural Networks (DNNs).
  • DNNs learn environmental characteristics to predict and adapt to moving optima.
  • Achieves lower tracking error with significantly fewer particles than existing methods.

Why it matters

This research significantly improves Particle Swarm Optimization's ability to track moving global optima in complex dynamic environments. By integrating DNNs, it offers a more efficient and accurate solution, requiring fewer particles than previous methods. This advancement is crucial for real-world optimization problems where environments constantly change.

Original Abstract

We propose novel particle swarm optimization (PSO) variants incorporated with deep neural networks (DNNs) for particles to pursue globally optimal positions in dynamic environments. PSO is a heuristic approach for solving complex optimization problems. However, canonical PSO and its variants struggle to adapt efficiently to dynamic environments, in which the global optimum moves over time, and to track them accurately. Many PSO algorithms improve convergence by increasing the swarm size beyond potential optima, which are global/local optima but are not identified until they are discovered. Additionally, in dynamic environments, several methods use multiple sub-population and re-diversification mechanisms to address outdated memory and local optima entrapment. To track the global optimum in dynamic environments with smaller swarm sizes, the DNNs in our methods determine particle movement by learning environmental characteristics and adapting dynamics to pursue moving optimal positions. This enables particles to adapt to environmental changes and predict the moving optima. We propose two variants: a swarm with a centralized network and distributed networks for all particles. Our experimental results show that both variants can track moving potential optima with lower cumulative tracking error than those of several recent PSO-based algorithms, with fewer particles than potential optima.

📬 Weekly AI Paper Digest

Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.