.png){kind=icon}
Return
Machine learning-enabled globally guaranteed evolutionary computation
.png){kind=icon}
OA
AI
DOI：10.1038/s42256-023-00642-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Evolutionary computation, for example, particle swarm optimization, has impressive achievements in solving complex problems in science and industry; however, an important open problem in evolutionary computation is that there is no theoretical guarantee of reaching the global optimum and general reliability; this is due to the lack of a unified representation of diverse problem structures and a generic mechanism by which to avoid local optima. This unresolved challenge impairs trust in the applicability of evolutionary computation to a variety of problems. Here we report an evolutionary computation framework aided by machine learning, named EVOLER, which enables the theoretically guaranteed global optimization of a range of complex non-convex problems. This is achieved by: (1) learning a low-rank representation of a problem with limited samples, which helps to identify an attention subspace; and (2) exploring this small attention subspace via the evolutionary computation method, which helps to reliably avoid local optima. As validated on 20 challenging benchmarks, this method finds the global optimum with a probability approaching 1. We use EVOLER to tackle two important problems: power grid dispatch and the inverse design of nanophotonics devices. The method consistently reached optimal results that were challenging to achieve with previous state-of-the-art methods. EVOLER takes a leap forwards in globally guaranteed evolutionary computation, overcoming the uncertainty of data-driven black-box methods, and offering broad prospects for tackling complex real-world problems. Evolutionary computation methods can find useful solutions for many complex real-world science and engineering problems, but in general there is no guarantee for finding the best solution. This challenge can be tackled with a new framework incorporating machine learning that helps evolutionary methods to avoid local optima.
Keywords:
PARTICLE SWARM OPTIMIZATION
ECONOMIC-DISPATCH
DECOMPOSITIONS
CONVERGENCE
STABILITY
ALGORITHM
DESIGN
Journal
IF:
23.9
Papers:
1.3K
Citations:
1.5W
Organization
View more organizations
Cited Papers
Forgetting velocity based improved comprehensive learning particle swarm optimization for non-convex economic dispatch problems with valve-point effects and multi-fuel options.png)
ENERGY
ENERGYIF9.4
PREAI
ShareSaveBiosensing with the singular phase of an ultrathin metal-dielectric nanophotonic cavityNATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAIShareSaveShareSaveComprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
ShareSave View more