Deephive: A Reinforcement Learning Approach for Automated Discovery of Swarm-Based Optimization Policies

We present an approach for designing swarm-based optimizers for the global optimization of expensive black-box functions. In the proposed approach, the problem of finding efficient optimizers is framed as a reinforcement learning problem, where the goal is to find optimization policies that require a few function evaluations to converge to the global optimum. The state of each particle within the swarm is defined as its current position and function value within a design space, and the particles learn to take favorable actions that maximize the reward, which is based on the final value of the objective function. The proposed approach is tested on 50 benchmark optimization functions and compared to the performance of other global optimization strategies. Furthermore, the generalization capabilities of the trained particles on the four categories of optimization benchmark functions are investigated. The results show superior performance compared to the other optimizers, desired scaling when the dimension of the functions is varied, and acceptable performance even when applied to unseen functions. On a broader scale, the results show promise for the rapid development of domain-specific optimizers.

Authors

Institutions

Publication Details

Journal
Algorithms
Published
2024-11-04
DOI
https://doi.org/10.3390/a17110500
Citations
2
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.69
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deephive: A Reinforcement Learning Approach for Automated Discovery of Swarm-Based Optimization Policies

Opeoluwa Owoyele, Eloghosa Ikponmwoba
2 citations
Algorithms
Metaheuristic Optimization Algorithms Research
0.69
article

Deephive: A Reinforcement Learning Approach for Automated Discovery of Swarm-Based Optimization Policies

Opeoluwa Owoyele, Eloghosa Ikponmwoba
article en
2 citations

Abstract

We present an approach for designing swarm-based optimizers for the global optimization of expensive black-box functions. In the proposed approach, the problem of finding efficient optimizers is framed as a reinforcement learning problem, where the goal is to find optimization policies that require a few function evaluations to converge to the global optimum. The state of each particle within the swarm is defined as its current position and function value within a design space, and the particles learn to take favorable actions that maximize the reward, which is based on the final value of the objective function. The proposed approach is tested on 50 benchmark optimization functions and compared to the performance of other global optimization strategies. Furthermore, the generalization capabilities of the trained particles on the four categories of optimization benchmark functions are investigated. The results show superior performance compared to the other optimizers, desired scaling when the dimension of the functions is varied, and acceptable performance even when applied to unseen functions. On a broader scale, the results show promise for the rapid development of domain-specific optimizers.

AlgorithmsVol. 17(11)
Louisiana State University (US)
Openalex Percentile: Top 23%
Metaheuristic Optimization Algorithms Research
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.