Learning Strategies in Particle Swarm Optimizer: A Critical Review and Performance Analysis

• URL: http://arxiv.org/abs/2504.11812v1
• Date: Wed, 16 Apr 2025 06:50:02 GMT
• Title: Learning Strategies in Particle Swarm Optimizer: A Critical Review and Performance Analysis
• Authors: Dikshit Chauhan, Shivani, P. N. Suganthan,
• Abstract summary: Particle swarm optimization (PSO) is widely adopted among SI algorithms due to its simplicity and efficiency.<n>We review and classify various learning strategies to address this gap, assessing their impact on optimization performance.<n>We discuss open challenges and future directions, emphasizing the need for self-adaptive, intelligent PSO variants.
• Score: 0.6437284704257459
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Nature has long inspired the development of swarm intelligence (SI), a key branch of artificial intelligence that models collective behaviors observed in biological systems for solving complex optimization problems. Particle swarm optimization (PSO) is widely adopted among SI algorithms due to its simplicity and efficiency. Despite numerous learning strategies proposed to enhance PSO's performance in terms of convergence speed, robustness, and adaptability, no comprehensive and systematic analysis of these strategies exists. We review and classify various learning strategies to address this gap, assessing their impact on optimization performance. Additionally, a comparative experimental evaluation is conducted to examine how these strategies influence PSO's search dynamics. Finally, we discuss open challenges and future directions, emphasizing the need for self-adaptive, intelligent PSO variants capable of addressing increasingly complex real-world problems.

Related papers

• Enhancing Explainability and Reliable Decision-Making in Particle Swarm Optimization through Communication Topologies [14.88267665338613]
  This study focuses on how different communication topologies affect convergence and search behaviors. Using an adapted IOHxplainer, we investigate how these topologies influence information flow, diversity, and convergence speed.
  arXiv  Detail & Related papers  (2025-04-17T10:05:10Z)
• A Survey on Inference Optimization Techniques for Mixture of Experts Models [50.40325411764262]
  Large-scale Mixture of Experts (MoE) models offer enhanced model capacity and computational efficiency through conditional computation.<n> deploying and running inference on these models presents significant challenges in computational resources, latency, and energy efficiency.<n>This survey analyzes optimization techniques for MoE models across the entire system stack.
  arXiv  Detail & Related papers  (2024-12-18T14:11:15Z)
• Boosting the Efficiency of Metaheuristics Through Opposition-Based Learning in Optimum Locating of Control Systems in Tall Buildings [0.0]
  Opposition-based learning is an effective approach to improve the performance of metaheuristic algorithms. Case studies on the application of opposition strategies in engineering problems are provided.
  arXiv  Detail & Related papers  (2024-11-07T13:05:40Z)
• Deep Reinforcement Learning for Online Optimal Execution Strategies [49.1574468325115]
  This paper tackles the challenge of learning non-Markovian optimal execution strategies in dynamic financial markets. We introduce a novel actor-critic algorithm based on Deep Deterministic Policy Gradient (DDPG) We show that our algorithm successfully approximates the optimal execution strategy.
  arXiv  Detail & Related papers  (2024-10-17T12:38:08Z)
• Orthogonally Initiated Particle Swarm Optimization with Advanced Mutation for Real-Parameter Optimization [0.04096453902709291]
  This article introduces an enhanced particle swarm (PSO), termed Orthogonal PSO with Mutation (OPSO-m) It proposes an array-based learning approach to cultivate an improved initial swarm for PSO, significantly boosting the adaptability of swarm-based optimization algorithms. The article further presents archive-based self-adaptive learning strategies, dividing the population into regular and elite subgroups.
  arXiv  Detail & Related papers  (2024-05-21T07:16:20Z)
• RLEMMO: Evolutionary Multimodal Optimization Assisted By Deep Reinforcement Learning [8.389454219309837]
  multimodal optimization problems (MMOP) requires finding all optimal solutions, which is challenging in limited function evaluations. We propose RLEMMO, a Meta-Black-Box Optimization framework, which maintains a population of solutions and incorporates a reinforcement learning agent. With a novel reward mechanism that encourages both quality and diversity, RLEMMO can be effectively trained using a policy gradient algorithm.
  arXiv  Detail & Related papers  (2024-04-12T05:02:49Z)
• Gradient Based Hybridization of PSO [1.1059341532498634]
  Particle Swarm Optimization (PSO) has emerged as a powerful metaheuristic global optimization approach over the past three decades. PSO faces challenges, such as premature stagnation in single-objective scenarios and the need to strike a balance between exploration and exploitation. Hybridizing PSO by integrating its cooperative nature with established optimization techniques from diverse paradigms offers a promising solution.
  arXiv  Detail & Related papers  (2023-12-15T11:26:36Z)
• Reinforcement Learning-assisted Evolutionary Algorithm: A Survey and Research Opportunities [63.258517066104446]
  Reinforcement learning integrated as a component in the evolutionary algorithm has demonstrated superior performance in recent years. We discuss the RL-EA integration method, the RL-assisted strategy adopted by RL-EA, and its applications according to the existing literature. In the applications of RL-EA section, we also demonstrate the excellent performance of RL-EA on several benchmarks and a range of public datasets.
  arXiv  Detail & Related papers  (2023-08-25T15:06:05Z)
• Simulation-guided Beam Search for Neural Combinatorial Optimization [13.072343634530883]
  We propose simulation-guided beam search (SGBS) for neural optimization problems. We hybridize SGBS with efficient active search (EAS), where SGBS enhances the quality of solutions backpropagated in EAS. We evaluate our methods on well-known CO benchmarks and show that SGBS significantly improves the quality of the solutions found under reasonable assumptions.
  arXiv  Detail & Related papers  (2022-07-13T13:34:35Z)
• Harnessing Heterogeneity: Learning from Decomposed Feedback in Bayesian Modeling [68.69431580852535]
  We introduce a novel GP regression to incorporate the subgroup feedback. Our modified regression has provably lower variance -- and thus a more accurate posterior -- compared to previous approaches. We execute our algorithm on two disparate social problems.
  arXiv  Detail & Related papers  (2021-07-07T03:57:22Z)
• Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyond [114.39616146985001]
  In machine learning and computer vision fields, despite the different motivations and mechanisms, a lot of complex problems contain a series of closely related subproblms. In this paper, we first uniformly express these complex learning and vision problems from the perspective of Bi-Level Optimization (BLO) Then we construct a value-function-based single-level reformulation and establish a unified algorithmic framework to understand and formulate mainstream gradient-based BLO methodologies.
  arXiv  Detail & Related papers  (2021-01-27T16:20:23Z)
• EOS: a Parallel, Self-Adaptive, Multi-Population Evolutionary Algorithm for Constrained Global Optimization [68.8204255655161]
  EOS is a global optimization algorithm for constrained and unconstrained problems of real-valued variables. It implements a number of improvements to the well-known Differential Evolution (DE) algorithm. Results prove that EOSis capable of achieving increased performance compared to state-of-the-art single-population self-adaptive DE algorithms.
  arXiv  Detail & Related papers  (2020-07-09T10:19:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.