Underdamped Particle Swarm Optimization

• URL: http://arxiv.org/abs/2503.11524v1
• Date: Fri, 14 Mar 2025 15:47:08 GMT
• Title: Underdamped Particle Swarm Optimization
• Authors: Matías Ezequiel Hernández Rodríguez,
• Abstract summary: Underdamped Particle Swarm Optimization (UEPS) is a novel metaheuristic inspired by both the Particle Swarm Optimization (PSO) algorithm and the dynamic behavior of an underdamped system.<n>The proposed metaheuristic is evaluated using benchmark functions and classic engineering problems, demonstrating its high robustness and efficiency.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This article presents Underdamped Particle Swarm Optimization (UEPS), a novel metaheuristic inspired by both the Particle Swarm Optimization (PSO) algorithm and the dynamic behavior of an underdamped system. The underdamped motion acts as an intermediate solution between undamped systems, which oscillate indefinitely, and overdamped systems, which stabilize without oscillation. In the context of optimization, this type of motion allows particles to explore the search space dynamically, alternating between exploration and exploitation, with the ability to overshoot the optimal solution to explore new regions and avoid getting trapped in local optima. First, we review the concept of damped vibrations, an essential physical principle that describes how a system oscillates while losing energy over time, behaving in an underdamped, overdamped, or critically damped manner. This understanding forms the foundation for applying these concepts to optimization, ensuring a balanced management of exploration and exploitation. Furthermore, the classical PSO algorithm is discussed, highlighting its fundamental features and limitations, providing the necessary context to understand how the underdamped behavior improves PSO performance. The proposed metaheuristic is evaluated using benchmark functions and classic engineering problems, demonstrating its high robustness and efficiency.

Related papers

• Energy Landscape Plummeting in Variational Quantum Eigensolver: Subspace Optimization, Non-iterative Corrections and Generator-informed Initialization for Improved Quantum Efficiency [0.0]
  Variational Quantum Eigensolver (VQE) faces significant challenges due to hardware noise and the presence of barren plateaus and local traps. We introduce a general formalism that optimize hardware resource utilization and accuracy by projecting VQE optimizations on to a reduced-dimensional subspace. Numerical simulations show that, when integrated with any chemistry-inspired ansatz, our method can provide one to two orders of magnitude better estimation of the minima.
  arXiv  Detail & Related papers  (2025-04-17T17:07:09Z)
• Understanding Optimization in Deep Learning with Central Flows [53.66160508990508]
  We show that an RMS's implicit behavior can be explicitly captured by a "central flow:" a differential equation. We show that these flows can empirically predict long-term optimization trajectories of generic neural networks.
  arXiv  Detail & Related papers  (2024-10-31T17:58:13Z)
• Efficient Real-time Path Planning with Self-evolving Particle Swarm Optimization in Dynamic Scenarios [6.951981832970596]
  Operation Form (TOF) converts particle-wise manipulations to tensor operations. Self-Evolving Particle Swarm Optimization (SEPSO) is developed. SEPSO is capable of generating superior paths with considerably better real-time performance.
  arXiv  Detail & Related papers  (2023-08-20T05:31:48Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• PAO: A general particle swarm algorithm with exact dynamics and closed-form transition densities [0.0]
  Particle swarm optimisation (PSO) approaches have proven to be highly effective in a number of application areas. In this work, a highly-general, interpretable variant of the PSO algorithm -- particle attractor algorithm (PAO) -- is proposed.
  arXiv  Detail & Related papers  (2023-04-28T16:19:27Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• Born-Infeld (BI) for AI: Energy-Conserving Descent (ECD) for Optimization [0.0]
  We introduce a framework based on energy-conserving Hamiltonian dynamics in a strongly mixing (chaotic) regime and its key properties analytically and numerically. The prototype is establish a discretization of Born-Infeld dynamics, depending on the objective function.
  arXiv  Detail & Related papers  (2022-01-26T19:00:05Z)
• Optimization on manifolds: A symplectic approach [127.54402681305629]
  We propose a dissipative extension of Dirac's theory of constrained Hamiltonian systems as a general framework for solving optimization problems. Our class of (accelerated) algorithms are not only simple and efficient but also applicable to a broad range of contexts.
  arXiv  Detail & Related papers  (2021-07-23T13:43:34Z)
• 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)
• Directed particle swarm optimization with Gaussian-process-based function forecasting [15.733136147164032]
  Particle swarm optimization (PSO) is an iterative search method that moves a set of candidate solution around a search-space towards the best known global and local solutions with randomized step lengths. We show that our algorithm attains desirable properties for exploratory and exploitative behavior.
  arXiv  Detail & Related papers  (2021-02-08T13:02:57Z)
• Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
  We propose a novel optimization backbone for visual SLAM systems. We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems. Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
  arXiv  Detail & Related papers  (2020-11-02T18:02:26Z)
• Dynamic Regret of Policy Optimization in Non-stationary Environments [120.01408308460095]
  We propose two model-free policy optimization algorithms, POWER and POWER++, and establish guarantees for their dynamic regret. We show that POWER++ improves over POWER on the second component of the dynamic regret by actively adapting to non-stationarity through prediction. To the best of our knowledge, our work is the first dynamic regret analysis of model-free RL algorithms in non-stationary environments.
  arXiv  Detail & Related papers  (2020-06-30T23:34:37Z)

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.